scirs2_graph::algorithms::traversal

Function bidirectional_search_digraph

Source 
pub fn bidirectional_search_digraph<N, E, Ix>(
    graph: &DiGraph<N, E, Ix>,
    start: &N,
    goal: &N,
) -> Result<Option<Vec<N>>>
where
    N: Node + Debug + Clone + Hash + Eq,
    E: EdgeWeight,
    Ix: IndexType,
Expand description

Bidirectional search for directed graphs