A shortest-route algorithm is used in network models to:
A. Identify bottlenecks in a network and hence identify the longest path.
B. Minimize total travel time from one site to each of the other sites in a transportation system.
C. Maximize throughput in networks with distinct entry (source node) and exit (sink node) points.
D. Identify the set of connecting branches having the shortest combined length.
Answer:B
A shortest-route algorithm is used in network models to:
A. Identify bottlenecks in a network and hence identify the longest path. B. Minimize total travel time from one site to each of the other sites in a transportation system. C. Maximize throughput in networks with distinct entry (source node) and exit (sink node) points. D. Identify the set of connecting branches having the shortest combined length.