Canonical graph labelling.
Leverages nauty and Traces to find canonical labellings for petgraph graphs.
Version 2.6 or 2.7 of the nauty and Traces library has to be installed separately before installing this crate.
```rust use petgraph::graph::UnGraph; use nauty_pet::prelude::*;
// Two different vertex labellings for the tree graph with two edges let g1 = UnGraph::<(), ()>::fromedges([(0, 1), (1, 2)]); let g2 = UnGraph::<(), ()>::fromedges([(0, 1), (0, 2)]);
// There are two equivalent labellings let automorphisminfo = g1.clone().tryintoautom().unwrap(); asserteq!(automorphism_info.grpsize(), 2.);
// The canonical forms are identical let c1 = g1.clone().intocanon(); let c2 = g2.clone().intocanon(); assert!(c1.is_identical(&c2));
// Alternatively, we can use a dedicated struct for canonically
// labelled graphs
let c1 = CanonGraph::from(g1);
let c2 = CanonGraph::from(g2);
assert_eq!(c1, c2);
```
libc: Allows using sparse graphs for canonisation. Before
enabling this feature, ensure that the nauty and Traces
library is linked to the same C library as this crate.
serde-1: Enables serialisation of
CanonGraph objects using
serde.
stable: Ensures deterministic behaviour when node or edge
weights are distinguishable, but compare equal.
To enable features feature1, feature2 add the following to
your Cargo.toml:
toml
[dependencies]
nauty-pet = { version = "0.7", features = ["feature1", "feature2"] }
License: Apache-2.0