CPSC 170 A
- Location
- Trexler 363
- Times
- 3:30- 5:30
- Office Hours
- M-Th 6 - 7 pm
- Office
- Trexler 365B
- chssmith AT roanoke DOT edu
< Back
Post Lab 33
Dijkstra's Algorithm
For the following graphs, write out the adjacency matrix and perform ALL steps of dijkstra's algorithm to find the shortest paths specified.
after a new vertex is added to the visited list, write out the structure of the cost list and the predecessor list.
- Path from 0 to 5
- Path from 0 to 3
Submission
Bring this completed worksheet with you to the beginning of class on Wednesday.
Post labs are to be done individually. Sharing files between students is not allowed. Doing so is an Academic Integrity violation, and will be treated as such.