Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03158984n
Noun Concept
Categories: Network theory, All articles needing additional references, Edsger W. Dijkstra, Graph distance, Polynomial-time problems
EN
shortest path problem  APSP  algebraic path problem  All-pairs shortest path  All-pairs shortest path problem
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
Definitions
Relations
Sources
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
The minimum length of a path between two points in a graph Wikipedia Disambiguation
Find a shortest path between two vertices in a graph Wikidata
IS A
computational problem
HAS KIND
Euclidean shortest path
widest path problem
HAS INSTANCE
Johnson's algorithm
Wikipedia
EN
shortest path problem
Wikidata
EN
shortest path problem
Wikipedia Redirections
EN
algebraic path problem, All-pairs shortest path, All-pairs shortest path problem, All pairs shortest path, All pairs shortest path problem, Applications of shortest path algorithms, Apsp, APSP, DAG shortest paths, Graph geodesic, negative cycle, Shortest-distance problems, shortest-path, shortest-path algorithms, Shortest-path problem, Shortest-path problems, shortest-path routing, shortest-paths, shortest path, shortest path algorithm, shortest path algorithms, Shortest Path Problem, shortest path problems, Shortest path routing, Shortest paths, Shortestpath, Shortestpath problem, Shortestpath problems, Shortestpaths, Single-destination, Single-destination shortest-path problem, Single-destination shortest path problem, Single-destination shortestpath problem, Single-destinations, Single-pair shortest-path problem, Single-source shortest-path problem, Single-source shortest-paths algorithms for directed graphs with nonnegative weights, Single-source shortest path problem, Single-source shortestpath problem, Single destination, Single destination shortest-path problem, Single destination shortest path problem, Single destination shortestpath problem, Single destinations, Single source shortest-path problem, Single source shortest path problem, Single source shortestpath problem, Singledestination, Singledestination shortest-path problem, Singledestination shortest path problem, Singledestination shortestpath problem, Singledestinations, Singlesource shortest-path problem, Singlesource shortest path problem, Singlesource shortestpath problem, SSSP, The Shortest Paths
Wikidata Alias
EN
single-pair shortest path problem

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