Chapter 37 Flashcards
1
Q
What is un-weighted graph
A
An un-weighted graph can be considered as a graph in which every edge has weight one unit.
2
Q
What is Dijkstra’s algorithm
A
Dijkstra’s algorithm is a simple greedy algorithm for computing the single-source shortest-paths to all other vertices.
3
Q
What is relaxation
A
The process of updating estimates in Dijkstra’s algorithm is called relaxation
