Struct triadic_census::OptDenseDigraph

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

Methods

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

fn new(n: usize) -> OptDenseDigraph<N, E>

fn ref_graph(&self) -> &Graph<N, E, Directed>

fn add_node_with_weight(&mut self, weight: N) -> NodeIdx

fn add_node(&mut self) -> NodeIdx

fn add_edge_with_weight(&mut self, src: NodeIdx, dst: NodeIdx, weight: E)

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

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

Trait Implementations

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

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

Formats the value using the given formatter.

impl<N, E> DirectedGraph for OptDenseDigraph<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
)

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

fn from(graph: Graph<N, E, Directed>) -> OptDenseDigraph<N, E>

Performs the conversion.