shortest_path_digraph

scirs2_graph::algorithms::shortest_path

Function shortest_path_digraph 

Source 
pub fn shortest_path_digraph<N, E, Ix>(
    graph: &DiGraph<N, E, Ix>,
    source: &N,
    target: &N,
) -> Result<Option<Path<N, E>>>
where
    N: Node + Debug,
    E: EdgeWeight + Zero + One + Add<Output = E> + PartialOrd + Copy + Debug + Default,
    Ix: IndexType,
👎Deprecated since 0.1.0-beta.2: Use dijkstra_path_digraph for future compatibility. This function will return PathResult in v1.0
Expand description

Finds the shortest path in a directed graph

§Deprecation Notice

This function will be updated in v1.0 to return a standardized PathResult type that provides more detailed information about the path and search process. The current API will remain available but deprecated.