nauty-pet 0.6.0

Canonical graph labelling using nauty/Traces and petgraph failed to build nauty-pet-0.6.0
Please check the build logs for more information.
See Builds for ideas on how to fix a failed build, or Metadata for how to configure builds.
If you believe this is' fault, open an issue.


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.


use petgraph::graph::UnGraph;
use nauty_pet::prelude::*;

// Two different vertex labellings for the tree graph with two edges
let g1 = UnGraph::<(), ()>::from_edges([(0, 1), (1, 2)]);
let g2 = UnGraph::<(), ()>::from_edges([(0, 1), (0, 2)]);

// There are two equivalent labellings
let automorphism_info = g1.clone().try_into_autom().unwrap();
assert_eq!(automorphism_info.grpsize(), 2.);

// The canonical forms are identical
let c1 = g1.clone().into_canon();
let c2 = g2.clone().into_canon();

// 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);


To enable the use of sparse graphs for canonisation, ensure that the nauty and Traces library is linked to the same C library as this crate.

Afterwards, add this to your Cargo.toml:

nauty-pet = { version = "0.6", features = ["libc"] }

License: Apache-2.0