Struct flag_algebra::flags::Digraph

pub struct Digraph { /* private fields */ }

Loopless oriented graphs.

Every pair of vertices has at most one edge. The possible relations between two vertices is described by the type Arc.

Implementations

impl Digraph

pub fn new<I>(n: usize, arcs: I) -> Selfwhere I: IntoIterator<Item = (usize, usize)>,

Create an oriented graph with n vertices and arcs in arcs.

Panics

• If arcs contains vertices not in {0, ..., n-1}
• If a loop (u, u) is provided
• If some arc is provided twice
• If both arcs (u, v) and (v, u) are provided

use flag_algebra::flags::Digraph;

// Oriented path with 3 vertices `0 -> 1 -> 2`
let p3 = Digraph::new(3, [(0, 1), (1, 2)]);

pub fn empty(n: usize) -> Self

Oriented graph with n vertices and no edge.

use flag_algebra::flags::Digraph;
assert_eq!(Digraph::empty(4), Digraph::new(4, []));

pub fn size(&self) -> usize

Number of vertices

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

Out-neigborhood of v.

use flag_algebra::flags::Digraph;
let p3 = Digraph::new(3, [(0,1), (1,2)]);
assert_eq!(p3.out_nbrs(1), vec![2]);

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

In-neigborhood of v.

use flag_algebra::flags::Digraph;
let p3 = Digraph::new(3, [(0,1), (1,2)]);
assert_eq!(p3.in_nbrs(1), vec![0]);

pub fn arc(&self, u: usize, v: usize) -> Arc

Oriented relation between u to v.

use flag_algebra::flags::{Digraph, Arc};
let p3 = Digraph::new(3, [(0,1), (1,2)]);
assert_eq!(p3.arc(0, 1), Arc::Edge);
assert_eq!(p3.arc(1, 0), Arc::BackEdge);
assert_eq!(p3.arc(0, 2), Arc::None);

pub fn add_sink(&self) -> Self

Oriented graph obtained from self by adding a vertex and every edge from the rest of the graph to that vertex.

Trait Implementations

impl Canonize for Digraph

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

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

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

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

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 Clone for Digraph

fn clone(&self) -> Digraph

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Digraph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Digraph

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

Deserialize this value from the given Serde deserializer.

impl Display for Digraph

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

Formats the value using the given formatter.

impl Draw for Digraph

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

fn draw(&self) -> SVG

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

fn to_svg_file(&self, filename: &str)

impl Flag for Digraph

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

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

const NAME: &'static str = "Digraph"

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 = 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 Ord for Digraph

fn cmp(&self, other: &Digraph) -> Ordering

This method returns an Ordering between self and other.

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

Compares and returns the maximum of two values.

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

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl PartialEq<Digraph> for Digraph

fn eq(&self, other: &Digraph) -> bool

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

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

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

impl PartialOrd<Digraph> for Digraph

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

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

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

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

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

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

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

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

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

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

impl Serialize for Digraph

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

Serialize this value into the given Serde serializer.

impl SubFlag<Digraph> for TriangleFree

const SUBCLASS_NAME: &'static str = "Triangle-free digraph"

Unique name for the subclass. This is used for naming the memoization directory.

fn is_in_subclass(flag: &Digraph) -> bool

Identifier function for the subclass.

const HEREDITARY: bool = F::HEREDITARY

impl Eq for Digraph

impl StructuralEq for Digraph

impl StructuralPartialEq for Digraph