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 ...

// and ending with item2. The list has one item if item1 and item2 are the // same, or no items if the path does not exist.

Graph algorithms constitute a pivotal component of modern computational science, underpinning diverse applications ranging from transportation optimisation and telecommunications to social network ...

Mathematics of Operations Research, Vol. 16, No. 3 (Aug., 1991), pp. 580-595 (16 pages) We consider a stochastic version of the classical shortest path problem whereby for each node of a graph, we ...