Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03220681n
Noun Concept
SYL
No term available
EN
Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, road networks. Wikipedia
Relations
Sources
IS A
EN
algorithm
EN
greedy algorithm
BASED ON
EN
breadth-first search
DERIVATIVE WORK
EN
A* search algorithm
EN
link-state routing protocol
IS-IS
EN
Open Shortest Path First
DIFFERENT FROM
EN
Dykstra's projection algorithm
DISCOVERER OR INVENTOR
EN
Edsger W. Dijkstra
NAMED AFTER
EN
Edsger W. Dijkstra
SOLVES
EN
pathfinding
EN
shortest path problem
USES
EN
graph

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License