Part b
Using your graph model from part (a), determine the fastest route from Stop 1 to Stop 10. Explain why Dijkstra’s algorithm is appropriate for this weighted network and outline the steps you take in applying it.
FILTERS
Close