Struct triadic_census::SimpleDigraph

pub struct SimpleDigraph<N, E> { /* fields omitted */ }

Methods

impl<N: Default, E: Default> SimpleDigraph<N, E>

fn new() -> SimpleDigraph<N, E>

fn add_node(&mut self) -> NodeIdx

fn add_edge(&mut self, src: NodeIdx, dst: NodeIdx)

fn from_(
    num_nodes: NodeIdx,
    edge_list: &[(NodeIdx, NodeIdx)]
) -> SimpleDigraph<N, E>

Trait Implementations

impl<N: Debug, E: Debug> Debug for SimpleDigraph<N, E>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<N, E> From<Graph<N, E, Directed>> for SimpleDigraph<N, E>

fn from(g: Graph<N, E, Directed>) -> SimpleDigraph<N, E>

Performs the conversion.

impl<N, E> DirectedGraph for SimpleDigraph<N, E>

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
)