Struct CGraph 

pub struct CGraph<const K: u8> {
    pub size: usize,
    /* private fields */
}

Edge-colored graphs.

Implentation of graphs whose edges are colored by a number in a set {1,…,K-1} (So that accounting for non-edges, each pair has K possible states).

Fields

size: usize

Implementations

impl<const K: u8> CGraph<K>

pub fn is_edge(&self, u: usize, v: usize) -> bool

Returns true if uv is an edge.

pub fn edge(&self, u: usize, v: usize) -> u8

Return the color of an edge uv. Returns 0 if there is no edge.

pub fn nbrs(&self, v: usize) -> Vec<usize>

Return the vector of vertices adjacent to v.

pub fn new(n: usize, edge: &[((usize, usize), u8)]) -> Self

Create a new colored graph with the specified edges. Edges not listed get value 0.

pub fn empty(n: usize) -> Self

Create the graph on n vertices with no edge.

Trait Implementations

impl<const K: u8> Canonize for CGraph<K>

fn size(&self) -> usize

Return the number of vertices.

fn invariant_neighborhood(&self, v: usize) -> Vec<Vec<usize>>

Return lists of vertices that are invariant isomorphism.

fn apply_morphism(&self, p: &[usize]) -> Self

Return the result of the action of a permuation p on the object.

fn invariant_coloring(&self) -> Option<Vec<u64>>

Optionally returns a value for each node that is invariant by isomorphism.

fn canonical(&self) -> Self

Computes a canonical form of a combinatorial object.

fn canonical_typed(&self, sigma: usize) -> Self

The “typed” objects refers to the case where only the action of permutations that are constant on 0..sigma are considered.

fn morphism_to_canonical(&self) -> Vec<usize>

Return a permutation p such that self.apply_morphism(&p) = self.canonical().

fn morphism_to_canonical_typed(&self, sigma: usize) -> Vec<usize>

Return a permutation phi such that g.apply_morphism(&phi) = canonical_typed(&g, sigma).

fn automorphisms(&self) -> AutomorphismIterator<Self>

Iterator on the automorphism group of g.

fn stabilizer(&self, sigma: usize) -> AutomorphismIterator<Self>

Iterator on the automorphisms of g that fix the sigma first vertices.

impl<const K: u8> Clone for CGraph<K>

fn clone(&self) -> CGraph<K>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const K: u8> Debug for CGraph<K>

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

Formats the value using the given formatter.

impl<'de, const K: u8> Deserialize<'de> for CGraph<K>

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<const K: u8> Display for CGraph<K>

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

Formats the value using the given formatter.

impl<const N: u8> Draw for CGraph<N>

fn draw_with_parameters<C>(&self, col: C, type_size: usize) -> SVG

where C: FnMut(usize) -> usize,

fn draw(&self) -> SVG

fn draw_typed(&self, type_size: usize) -> SVG

fn to_svg_file(&self, filename: &str)

impl<const K: u8> Flag for CGraph<K>

const NAME: &'static str

A unique name for this type of flags. For instance “Graph”. This nameis used for naming the associated data subdirectory.

fn induce(&self, p: &[usize]) -> Self

Returns the subflag induced by the vertices in the slice set.

fn size_zero_flags() -> Vec<Self>

Returns the set of all flags of size 0.

fn superflags(&self) -> Vec<Self>

Return the list of flags of size self.size() + 1 that contain self as an induced subflag.

const HEREDITARY: bool = true

Setting this parameter to false deactivate checks that induced subflags exists. Must be true in every classic case.

fn generate_next(previous: &[Self]) -> Vec<Self>

Return the list of flags of size self.size() + 1 that contain self as an induced subflag reduced modulo isomorphism.

fn generate(n: usize) -> Vec<Self>

Return the list of flags of size n reduced modulo isomorphism.

fn generate_typed_up(type_flag: &Self, g_vec: &[Self]) -> Vec<Self>

Return the list of flags of g_vec that can be rooted on the flag type_flag. Each different way to root this flag give a different flag in the result.

fn generate_typed(type_flag: &Self, size: usize) -> Vec<Self>

Return the list of flag of size size rooted on type_flag reduced modulo (typed) isomorphism.

fn select_type(&self, eta: &[usize]) -> Self

Reorder self so that the eta.len() first vertices are the values of eta in the corresponding order.

impl<const K: u8> Ord for CGraph<K>

fn cmp(&self, other: &CGraph<K>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<const K: u8> PartialEq for CGraph<K>

fn eq(&self, other: &CGraph<K>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<const K: u8> PartialOrd for CGraph<K>

fn partial_cmp(&self, other: &CGraph<K>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<const K: u8> Serialize for CGraph<K>

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<const K: u8> Eq for CGraph<K>

impl<const K: u8> StructuralPartialEq for CGraph<K>