Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.

Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.

Like this presentation? Why not share!

- The Shortest Route Problem by Charmaine Xy-Za Yape 7126 views
- 1.2 theories of nationalism by Lon Salva 16209 views
- Math project final 1 by Rain Wolf's 1288 views
- Process of research by Lon Salva 556 views
- Political science part xi by Lon Salva 726 views
- Political science part iii by Lon Salva 1175 views

2,700 views

Published on

Networking Model

No Downloads

Total views

2,700

On SlideShare

0

From Embeds

0

Number of Embeds

4

Shares

0

Downloads

66

Comments

0

Likes

1

No embeds

No notes for slide

- 1. SHORTEST ROUTE PROBLEM<br />A Networking Model Report for<br />DPA 702 <br />QUANTITATIVE METHODS OF RESEARCH<br />By:<br />ALONA M. SALVACebu Technological University<br />
- 2. What is the shortest route between some node i and some other node j in the graph? <br />
- 3. 0. To initialize: <br /><ul><li>a. the origin is the only solved node.
- 4. b. the distance to the origin is 0.
- 5. c. the arc set is empty. </li></ul>Dijkstra’s algorithm<br />
- 6. 1. Find all the unsolved nodes that are directly connected by a single arc to any solved node. For each unsolved node, calculate all of the “candidate distances” (there may be several of these for one unsolved node because it may directly connect to more than one solved node): <br /><ul><li>a. choose an arc connecting the unsolved node directly to a solved node.
- 7. b. the “candidate distance” is (distance to solved node) + (length of arc directly connecting the solved and the unsolved node) </li></ul>Dijkstra’s algorithm<br />
- 8. 2. Choose the smallest candidate distance: <br /><ul><li>a. add the corresponding unsolved node to the solved set.
- 9. b. distance to the newly solved node is the candidate distance.
- 10. c. add the corresponding arc to the arc set. </li></ul>Dijkstra’s algorithm<br />
- 11. 3. If the newly solved node is not the destination node, then go to step 1. Else, stop and recover the solution: <br /><ul><li>a. length of shortest route from origin to destination is the distance to the destination node.
- 12. b. shortest route is found by tracing backwards from the destination node to the origin (or the reverse) using the arcs in the arc set. It is usually easiest to trace backwards because each node is reached from exactly one other node, but may have outward arcs to several other nodes. </li></ul>Dijkstra’s algorithm<br />
- 13. Dijkstra’s algorithm<br />
- 14. Dijkstra’s algorithm<br />
- 15. Dijkstra’s algorithm<br />
- 16. Dijkstra’s algorithm<br />
- 17. Dijkstra’s algorithm<br />
- 18. Dijkstra’s algorithm<br />
- 19. Ref:<br />Practical Optimization: A Gentle Introduction, John W. Chinneck, 2010<br />http://www.sce.carleton.ca/faculty/chinneck/po.html <br />

No public clipboards found for this slide

×
### Save the most important slides with Clipping

Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.

Be the first to comment