Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00463946n
Noun Concept
SYL
No term available
EN
Johnson's algorithm is a way to find the shortest paths between all pairs of vertices in an edge-weighted directed graph. Wikipedia
Relations
Sources
IS A
EN
algorithm
EN
shortest path problem
DISCOVERER OR INVENTOR
EN
Donald B. Johnson
NAMED AFTER
EN
Donald B. Johnson
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