single_source_shortest_path : criterion in case of multiple shortest paths?

Question

In case more than one shortest path between two nodes is available, which is the criterion used by single_source_shortest_path to pick one path?

Answer 1

There is none. Since it traverses the graph with a BFSish approach, and the order it visits a node's neighbors, is determined by a for loop, and that has an arbitrary order.