pub fn dijkstra_single_source<T, S>( graph: &S, source: usize, directed: bool, returnpredecessors: bool, ) -> SparseResult<(Array1<T>, Option<Array1<isize>>)>where T: Float + Debug + Copy + 'static, S: SparseArray<T>,
Dijkstra’s algorithm for single source shortest paths