Saved Bookmarks
| 1. |
What Is The Goal Of The Shortest Distance Algorithm? |
|
Answer» The goal is COMPLETELY fill the distance ARRAY so that for each VERTEX v, the VALUE of distance[v] is the weight of the shortest path from start to v. The goal is completely fill the distance array so that for each vertex v, the value of distance[v] is the weight of the shortest path from start to v. |
|