Graphs Flashcards

1
Q

When a graph is unweighted, what algorithm do we use for single source shortest path?

A

Breadth-First Search

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What algorithm do we use for weighted single source shortest path?

A

Dijkstra

How well did you know this?
1
Not at all
2
3
4
5
Perfectly