Struct triadic_census::OptSparseDigraph
[−]
[src]
pub struct OptSparseDigraph<N, E> { /* fields omitted */ }
Trait Implementations
impl<N: Debug, E: Debug> Debug for OptSparseDigraph<N, E>
[src]
impl<N, E> From<SimpleDigraph<N, E>> for OptSparseDigraph<N, E>
[src]
fn from(graph: SimpleDigraph<N, E>) -> OptSparseDigraph<N, E>
Performs the conversion.
impl<N, E> DirectedGraph for OptSparseDigraph<N, E>
[src]
fn node_count(&self) -> NodeIdx
fn has_edge(&self, src: NodeIdx, dst: NodeIdx) -> bool
fn each_undirected_neighbor<F: FnMut(NodeIdx)>(
&self,
node: NodeIdx,
callback: F
)
&self,
node: NodeIdx,
callback: F
)