Longest path is NP-complete, as is shortest path with negative weight cycles in the graph. Breadth-first search will get you a shortest path on an unweighted graph.

We consider the shortest paths between all pairs of nodes in a directed or undirected complete graph with edge lengths which are uniformly and independently distributed in [0, 1].

Facts about the single source shortest path problem The aim of the single source shortest path problem is to find the shortest paths from a given starting node to all other nodes in a network.

There is a new sorting algorithm a deterministic O (m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

Graph Algorithms and Shortest Path Queries Publication Trend The graph below shows the total number of publications each year in Graph Algorithms and Shortest Path Queries.

This paper considers a stochastic shortest path problem where the arc lengths are independent random variables following a normal distribution. In this problem, the optimal path is one that maximizes ...

I need to figure out how to find the shortest path between two vertices in an adjacency matrix representation of an undirected graph. I get the impression that I'm supposed to use Dijkstra's ...