Struct Graph 

pub struct Graph<N, H, E>
where
    N: Clone + Debug + Eq + Hash + Ord,
    H: Clone + Debug,
    E: Clone + Debug + Eq + Hash + Ord,
{ /* private fields */ }

A graph suitable for canonical labelling.

N — vertex data (participates in comparison, determines initial colour). H — vertex hidden data (does not affect the canonical form; used to store e.g. the original slot position of a tensor). E — edge data (participates in comparison).

Implementations

impl<N, H, E> Graph<N, H, E>

where N: Clone + Debug + Eq + Hash + Ord, H: Clone + Debug, E: Clone + Debug + Eq + Hash + Ord,

pub fn new() -> Self

Create an empty graph.

pub fn add_node(&mut self, data: N, hidden: H) -> usize

Add a vertex with the given data and hidden payload. Returns the new vertex index.

pub fn node_count(&self) -> usize

Number of vertices.

pub fn node_data(&self, v: usize) -> &N

Vertex data.

pub fn node_hidden(&self, v: usize) -> &H

Vertex hidden payload.

pub fn add_directed_edge(&mut self, from: usize, to: usize, data: E)

Add a directed edge from → to with the given data.

pub fn add_undirected_edge(&mut self, u: usize, v: usize, data: E)

Add an undirected edge between u and v with the given data.

pub fn edges_of(&self, v: usize) -> EdgeIter<'_, N, H, E>

Iterate edges incident to vertex v. Each yielded item is (edge_index, neighbour_vertex, edge_data, is_directed, is_outgoing).

pub fn canonize(&self) -> CanonicalForm<N, H, E>

Compute the canonical labelling of this graph.

Trait Implementations

impl<N, H, E> Clone for Graph<N, H, E>

where N: Clone + Debug + Eq + Hash + Ord + Clone, H: Clone + Debug + Clone, E: Clone + Debug + Eq + Hash + Ord + Clone,

fn clone(&self) -> Graph<N, H, E>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<N, H, E> Debug for Graph<N, H, E>

where N: Clone + Debug + Eq + Hash + Ord + Debug, H: Clone + Debug + Debug, E: Clone + Debug + Eq + Hash + Ord + Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<N, H, E> Default for Graph<N, H, E>

where N: Clone + Debug + Eq + Hash + Ord, H: Clone + Debug, E: Clone + Debug + Eq + Hash + Ord,

fn default() -> Self

Returns the “default value” for a type.