Enum FamousGraph 

pub enum FamousGraph {
    Bull,
    Chvatal,
    Coxeter,
    Cubical,
    Diamond,
    Dodecahedron,
    Folkman,
    Franklin,
    Frucht,
    Grotzsch,
    Heawood,
    Herschel,
    House,
    HouseX,
    Icosahedron,
    KrackhardtKite,
    Levi,
    McGee,
    Meredith,
    NoPerfectMatching,
    Nonline,
    Octahedron,
    Petersen,
    Robertson,
    SmallestCyclicGroup,
    Tetrahedron,
    Thomassen,
    Tutte,
    Uniquely3Colorable,
    Walther,
    Zachary,
}

The named graphs known to Graph::famous.

Each variant documents its size; FamousGraph::name gives the name understood by igraph, and FamousGraph::ALL lists them all. FamousGraph implements AsRef<str>, so it can be passed to Graph::famous directly:

use igraph::{constructors::FamousGraph, prelude::*};
let g = Graph::famous(FamousGraph::Heawood).unwrap();
assert_eq!((g.vcount(), g.ecount()), FamousGraph::Heawood.size());

Variants

Bull

The bull graph: a triangle with two pendant “horns” (5 vertices, 5 edges).

Chvatal

The Chvátal graph: the smallest triangle-free, 4-chromatic, 4-regular graph (12, 24).

Coxeter

The Coxeter graph: a non-Hamiltonian cubic symmetric graph (28, 42).

Cubical

The skeleton of the cube (8, 12).

Diamond

The diamond: two triangles sharing an edge (4, 5).

Dodecahedron

The skeleton of the dodecahedron (20, 30).

Folkman

The Folkman graph: the smallest semisymmetric graph (20, 40).

Franklin

The Franklin graph, related to colorings of the Klein bottle (12, 18).

Frucht

The Frucht graph: the smallest cubic graph with no non-trivial automorphism (12, 18).

Grotzsch

The Grötzsch graph: triangle-free with chromatic number 4 (11, 20).

Heawood

The Heawood graph: the 6-cage, the smallest cubic graph of girth 6 (14, 21).

Herschel

The Herschel graph: the smallest non-Hamiltonian polyhedral graph (11, 18).

House

The house graph: a triangle on top of a square (5, 6).

HouseX

The house graph with an X in the square (5, 8).

Icosahedron

The skeleton of the icosahedron (12, 30).

KrackhardtKite

Krackhardt’s kite social network (10, 18).

Levi

The Levi graph: a 4-arc transitive cubic graph (30, 45).

McGee

The McGee graph: the unique 3-regular 7-cage (24, 36).

Meredith

The Meredith graph: 4-regular, 4-connected and non-Hamiltonian (70, 140).

NoPerfectMatching

A connected graph without a perfect matching (16, 27).

Nonline

The disjoint union of the 9 forbidden subgraphs of line graphs (50, 72).

Octahedron

The skeleton of the octahedron (6, 12).

Petersen

The Petersen graph: 3-regular, the smallest hypohamiltonian graph (10, 15).

Robertson

The Robertson graph: the unique (4,5)-cage (19, 38).

SmallestCyclicGroup

A smallest non-trivial graph whose automorphism group is cyclic (9, 15).

Tetrahedron

The skeleton of the tetrahedron, i.e. K_4 (4, 6).

Thomassen

The Thomassen graph: the smallest hypotraceable graph (34, 52).

Tutte

The Tutte graph: a counterexample to Tait’s Hamiltonian conjecture (46, 69).

Uniquely3Colorable

A triangle-free, uniquely 3-colorable graph (12, 22).

Walther

The Walther graph: an identity graph (25, 31).

Zachary

Zachary’s karate club social network (34, 78).

Implementations

impl FamousGraph

pub const ALL: &'static [FamousGraph]

All the famous graphs, in the order of the igraph documentation (alphabetical, except that Noperfectmatching precedes Nonline).

pub fn name(self) -> &'static str

The name igraph uses for this graph (matching is case insensitive).

pub fn size(self) -> (usize, usize)

The (vertex count, edge count) of this graph.

Trait Implementations

impl AsRef<str> for FamousGraph

fn as_ref(&self) -> &str

Converts this type into a shared reference of the (usually inferred) input type.

impl Clone for FamousGraph

fn clone(&self) -> FamousGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for FamousGraph

impl Debug for FamousGraph

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

Formats the value using the given formatter.

impl Display for FamousGraph

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

Formats the value using the given formatter.

impl Eq for FamousGraph

impl Hash for FamousGraph

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for FamousGraph

fn eq(&self, other: &FamousGraph) -> 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 StructuralPartialEq for FamousGraph