2 - marks * conditions involved in floyd's algorithm * residual network in flow of network * characterisitics of transportation network

A traffic system could be represented as a network in order to determine bottlenecks using the maximal flow network algorithm. *TrueFalse

What does Dijkstra's algorithm guarantee when it is applied to a graph?Select one:a. It finds all possible paths from one vertex to another in the shortest time.b. It calculates the maximum capacity of flow from source to sink in a network.c. It finds the shortest path from a single source to all other vertices in a graph with non-negative weights.d. It identifies whether a graph is bipartite or not

A network is an arrangement of paths connected at various points through which items move.Group of answer choicesTrueFalse

10 In the THG Model, what is the final stage of transportation network development? A. Initial exploration B. Development of a core-periphery structure C. Integration and consolidation of networks D. Decline of transport routes

The diagram below shows an input network for the minimum-cost flow problem, and the flow (shown in red) in this network at the end of the 2-nd iteration of the Successive Shortest Path algorithm. During the computation, whenever there is a choice of a vertex, the algorithm selects the vertex which is first in the lexicographical order. (This means, for example, that during the first iteration, the algorithm selected vertex p1 from the two available supply vertices, and selected vertex r1 from the two available demand vertices.) Complete the following statements by dragging and dropping appropriate options.There was  Blank 1 Question 1 path from p2 to r1 in the residual network at the beginning of the 2-nd iteration.At the end of the 2-nd iteration, the flow saturates  Blank 2 Question 1 edges.At the beginning of the 3-rd iteration, the residual supply at vertex p2 is  Blank 3 Question 1 .In the residual network constructed in the 3-rd iteration,  Blank 4 Question 1 vertices are reachable from vertex p2.The cost of the path selected in the residual network in the 3-rd iteration is  Blank 5 Question 1 .The flow in the input network computed by the end of the 3-rd iteration  Blank 6 Question 1 satisfy all supply and demand.