Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00463946n
Noun Concept
Categories: Graph distance, Graph algorithms, Search algorithms
EN
Johnson's algorithm  Johnson algorithm
EN
Johnson's algorithm is a way to find the shortest paths between all pairs of vertices in an edge-weighted directed graph. Wikipedia
Definitions
Relations
Sources
EN
Johnson's algorithm is a way to find the shortest paths between all pairs of vertices in an edge-weighted directed graph. Wikipedia
algorithm to find shortest paths between all pairs of vertices in a sparse, edge-weighted (possibly negatively), directed graph; uses the Bellman–Ford algorithm to remove negative weights and Dijkstra’s algorithm on the rest Wikidata
IS A
algorithm
shortest path problem
DISCOVERER OR INVENTOR
Donald B. Johnson
NAMED AFTER
Donald B. Johnson
USES
graph
Wikipedia
EN
Johnson's algorithm
Wikidata
EN
Johnson's algorithm
Wikipedia Redirections
EN
Johnson algorithm

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