FindShortestPath

 FindShortestPath(graph, source, destination)

find a shortest path in the graph from source to destination.

See

• Wikipedia - Pathfinding
• Wikipedia - Shortest path problem

Examples

>> FindShortestPath(Graph({1 -> 2, 2 -> 4, 1 -> 3,  3 -> 2, 3 -> 4},{EdgeWeight->{3.0,1.0,1.0,1.0,3.0}}),1,4)
{1,3,2,4}

Related terms

GraphCenter, GraphDiameter, GraphPeriphery, GraphRadius, AdjacencyMatrix, EdgeList, EdgeQ, EulerianGraphQ, FindEulerianCycle, FindHamiltonianCycle, FindVertexCover, FindShortestTour, FindSpanningTree, Graph, GraphQ, HamiltonianGraphQ, VertexEccentricity, VertexList, VertexQ

Implementation status

• ✅ - full supported

Github

• Implementation of FindShortestPath