Module motifs 

Motif census algorithms.

• Dyad census (ALGO-MO-001): counts mutual, asymmetric, and null dyads.
• Triad census (ALGO-MO-002): classifies all vertex triples into 16 types.
• Graph count (ALGO-MO-003): number of non-isomorphic graphs.
• Isoclass (ALGO-MO-004): isomorphism class classification for small graphs.

Re-exports

pub use graph_count::graph_count;

pub use isoclass::isoclass;

pub use isoclass::isoclass_create;

pub use isoclass::isoclass_subgraph;

pub use motifs_randesu::motifs_randesu;

pub use motifs_randesu::motifs_randesu_callback;

pub use motifs_randesu::motifs_randesu_estimate;

pub use motifs_randesu::motifs_randesu_no;

pub use triad_census::TriadCensus;

pub use triad_census::TriadType;

pub use triad_census::triad_census;

Modules

graph_count

Graph count (ALGO-MO-003) — number of non-isomorphic graphs.

isoclass

Isomorphism class functions (ALGO-MO-004).

motifs_randesu

Motif census via ESU enumeration (ALGO-MO-005).

triad_census

Triad census (ALGO-MO-002).

Structs

DyadCensus

Result of a dyad census on a directed graph.

Functions

dyad_census

Counts the mutual, asymmetric, and null dyads in a directed graph.