scirs2_graph::algorithms::transformations

Function line_digraph

Source 
pub fn line_digraph<N, E, Ix>(
    digraph: &DiGraph<N, E, Ix>,
) -> DiGraph<(N, N), (), Ix>
where
    N: Node + Clone,
    E: EdgeWeight + Clone,
    Ix: IndexType,
Expand description

Creates a line graph from a directed graph

For directed graphs, two vertices in the line graph are connected if the head of one edge equals the tail of another.