Graphs Flashcards
1
Q
When a graph is unweighted, what algorithm do we use for single source shortest path?
A
Breadth-First Search
2
Q
What algorithm do we use for weighted single source shortest path?
A
Dijkstra
When a graph is unweighted, what algorithm do we use for single source shortest path?
Breadth-First Search
What algorithm do we use for weighted single source shortest path?
Dijkstra