Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03158984n
Noun Concept
NL
shortest path problem  kortste pad  kortste pad probleem
EN
In graph theory, the shortest path problem is the problem of finding a path between two vertices in a graph such that the sum of the weights of its constituent edges is minimized. Wikipedia
Relations
Sources
IS A
rekenkundig probleem
HAS KIND
euclidische kortste weg
EN
widest path problem
HAS INSTANCE
johnson's algoritme
Wikidata
NL
shortest path problem
Wikipedia Translations
NL
kortste pad, kortste pad probleem

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