Shortest path algorithms info Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

What is Dijkstra’s shortest path algorithm?

A

An algorithm to find the shortest path between a start and end nodes on a weighted graph

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

what is the ‘least cost path’?

A

it is the best way to get from node to node

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

what is the purpose of Dijkstra’s algorithm?

A

find the shortest path from the start node to all other nodes on the graph

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

what is the output from Dijkstra’s algorithm?

A

a list which holds:
- the node label
- the cost of the shortest path to that node
- the label of the previous node in the path

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