[−][src]Trait graph_neighbor_matching::Graph

pub trait Graph {
    type EDGE: Edges;
    type NODE: Clone;
    pub fn num_nodes(&self) -> usize;

    pub fn node_degree(&self, node_idx: usize) -> usize;

    pub fn node_value(&self, node_idx: usize) -> &Self::NODE;

    pub fn in_edges_of(&self, node_idx: usize) -> &Self::EDGE;

    pub fn out_edges_of(&self, node_idx: usize) -> &Self::EDGE;

    pub fn to_petgraph(&self) -> PetGraph<Self::NODE, EdgeWeight, Directed> { ... }
}

Abstract representation of a Graph. Used by the algorithm.

Associated Types

type EDGE: Edges[src]

type NODE: Clone[src]

Loading content...

Required methods

pub fn num_nodes(&self) -> usize[src]

pub fn node_degree(&self, node_idx: usize) -> usize[src]

pub fn node_value(&self, node_idx: usize) -> &Self::NODE[src]

pub fn in_edges_of(&self, node_idx: usize) -> &Self::EDGE[src]

pub fn out_edges_of(&self, node_idx: usize) -> &Self::EDGE[src]

Loading content...

Provided methods

pub fn to_petgraph(&self) -> PetGraph<Self::NODE, EdgeWeight, Directed>[src]

Loading content...

Implementors

impl<T: Debug + Clone> Graph for OwnedGraph<T>[src]

type EDGE = EdgeList

type NODE = T

Loading content...