Find a shortest weighted path between two vertices of a graph
FindShortestPath[g, s, t]
FindShortestPath[g, s, All]
FindShortestPath[g, All, t]
FindShortestPath[g, All, All]
FindShortestPath[{v -> w, …}, …]
FindShortestPath[Graph[{1→2, 2→3, 3→4, 4→1, 3→1, 2→2}], 4, 2]
→ {4, 1, 2}