pathfinder::map::network
pub fn path_shortest_leg<'a>( network: &'a Network<Node>, start: Node, goal: Node) -> Result<Vec<Node>>
Creates a path using the 'shortest leg' in the journey at each stop.
The shorest leg means that for every occurence of a path, the alternatives are sorted and the shortest is always selected.
The path could not be found.
The provided A and B don't exist in the network.