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
Activity 33
Dijkstra's Algorithm
For the following graph, write out the adjacency matrix and perform ALL steps of dijkstra's algorithm to find the shortest path from 0 to 5.
after a new vertex is added to the visited list, write out the structure of the cost list and the predecessor list.