Struct flag_algebra::flags::CGraph

pub struct CGraph<E> {
    pub size: usize,
    // some fields omitted
}

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).

The number k is determined at compile-time by a type-level number from the typenum crate. Specifically, CGraph<Uk> represents k-edge-colored graphs if Uk is the typenum type reprenting k.

Fields

size: usize

Implementations

impl<E> CGraph<E>

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

Returns true id 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 where
    E: Unsigned, 

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<E> Canonize for CGraph<E> where
    E: Unsigned + Clone + Eq + Ord + Debug, 

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<E: Clone> Clone for CGraph<E>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<E: Debug> Debug for CGraph<E>

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

Formats the value using the given formatter.

impl<'de, E> Deserialize<'de> for CGraph<E>

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<E> Display for CGraph<E>

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

Formats the value using the given formatter.

impl<E> Draw for CGraph<E>

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<E: Eq> Eq for CGraph<E>

impl<E> Flag for CGraph<E> where
    E: Unsigned + Clone + Eq + Ord + Debug, 

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

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

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 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

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<E: Ord> Ord for CGraph<E>

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

This method returns an Ordering between self and other.

#[must_use]fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]fn clamp(self, min: Self, max: Self) -> Self

🔬 This is a nightly-only experimental API. (clamp)

Restrict a value to a certain interval.

impl<E: PartialEq> PartialEq<CGraph<E>> for CGraph<E>

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

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &CGraph<E>) -> bool

This method tests for !=.

impl<E: PartialOrd> PartialOrd<CGraph<E>> for CGraph<E>

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

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

fn lt(&self, other: &CGraph<E>) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &CGraph<E>) -> bool

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

fn gt(&self, other: &CGraph<E>) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &CGraph<E>) -> bool

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

impl<E> Serialize for CGraph<E>

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

Serialize this value into the given Serde serializer.

impl<E> StructuralEq for CGraph<E>

impl<E> StructuralPartialEq for CGraph<E>