1 / 5

For each of the following networks:

For each of the following networks:. Use Dijkstra's algorithm to find a quickest route between the stated vertices Indicate the order in which the vertices were labelled, Show clearly how you determined your quickest route from your labelling.

marah-weiss
Download Presentation

For each of the following networks:

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. For each of the following networks: Use Dijkstra's algorithm to find a quickest route between the stated vertices Indicate the order in which the vertices were labelled, Show clearly how you determined your quickest route from your labelling. Is the route you have found the only quickest route? Give a reason for your answer.

  2. Shortest route between A and H

  3. Shortest Route between S and T

  4. Shortest route between A to J

  5. Answers to questions (i) Labelling order A C B D F E G H Shortest Route A B F H • Labelling order S C B A E D G F T Shortest Route S C E F T • Labelling order A B C D E F H G I J Shortest Route J H E C A or J H E D A

More Related