Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Computing Theory > 4.3.6.1 Dijkstra’s shortest path algorithm > Flashcards

4.3.6.1 Dijkstra’s shortest path algorithm Flashcards

1
Q

What is Dijkstra’s algorithm used for?

A

Finding the shortest paths between nodes in a graph, e.g GPS system, routing protocols

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

Computing Theory (102 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions