In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights...

algorithm (/ˈdaɪkstrəz/ DYKE-strəz) is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example...

computer science, the longest path problem is the problem of finding a simple path of maximum length in a given graph. A path is called simple if it does...

k shortest path routing problem is a generalization of the shortest path routing problem in a given network. It asks not only about a shortest path but...

Dijkstra's algorithm for finding the shortest path on a weighted graph. Pathfinding is closely related to the shortest path problem, within graph theory, which...

The Euclidean shortest path problem is a problem in computational geometry: given a set of polyhedral obstacles in a Euclidean space, and two points, find...

edge in the path. The widest path problem is also known as the maximum capacity path problem. It is possible to adapt most shortest path algorithms to...

vertex-disjoint paths of length at most k. Glossary of graph theory Path graph Polygonal chain Shortest path problem Longest path problem Dijkstra's algorithm...

computer science, a shortest-path tree rooted at a vertex v of a connected, undirected graph G is a spanning tree T of G, such that the path distance from root...

A central problem in algorithmic graph theory is the shortest path problem. One of the generalizations of the shortest path problem is known as the...