ShortestPath returns a shortest path from u to v using a breadth-first search. Edge weights are ignored. The output is a list of vertices in the order they appear on the path. If no such a path exists, an error is returned.

To compute shortest paths with respect to edge weights, use either DijkstrasAlgorithm or BellmanFordAlgorithm.