fn compute_shortest_path_length<G>( graph: G, source: G::NodeId, target: G::NodeId, ) -> G::EdgeWeightwhere G: Visitable + IntoEdges, G::NodeId: Eq + Hash, G::EdgeWeight: Measure + Copy,