rust-igraph 0.0.1-alpha.3

Pure-Rust, high-performance graph & network analysis library — 370+ algorithms, zero unsafe, igraph-compatible
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

//! Graph isomorphism algorithms (ALGO-ISO-*).
//!
//! First entry: [`simplify_and_colorize`] (`ALGO-ISO-030`) — turn a graph
//! with self-loops and multi-edges into a vertex/edge colored simple
//! graph, the form consumed by isomorphism backends such as VF2.

pub(crate) mod canonical;
pub(crate) mod lad;
pub(crate) mod queries;
pub(crate) mod simplify_and_colorize;
pub(crate) mod subiso;
pub(crate) mod vf2;

pub use canonical::automorphism_group::automorphism_group;
pub use canonical::canonical_permutation::canonical_permutation;
pub use canonical::count_automorphisms::count_automorphisms;
pub use canonical::isomorphic_bliss::isomorphic_bliss;
pub use lad::{LadSubisomorphism, get_subisomorphisms_lad, subisomorphic_lad};
pub use queries::{isomorphic, subisomorphic};
pub use simplify_and_colorize::{SimplifyAndColorize, simplify_and_colorize};
pub use subiso::{
    Vf2Subisomorphism, count_subisomorphisms_vf2, get_subisomorphisms_vf2, subisomorphic_vf2,
};
pub use vf2::{Vf2Isomorphism, count_isomorphisms_vf2, get_isomorphisms_vf2, isomorphic_vf2};