- Bump Boost requirement to 1.67.
- Require C++17.
- Bump PermGroup requirement to 0.5.
- Added convenience type aliasses
ordered_graph::Graph
andordered_graph::IndexMap
.
- Fix extranous dereference in
ordered_graph::get_graph
. Thanks to Gregor Kälin. - Use
idx
when setting up initial partition. Thanks to Gregor Kälin. - Use
get(idx, v)
instead ofidx[v]
consistently everywhere. - Add missing concept checks in
canonicalize
for the graph type. - Add missing inline on
make_default_visitor
. Thanks to Gregor Kälin. - Doc, fix indendation issues.
- Update documentation for
EdgeHandler
andcanonicalize
.
- Change to CMake as build system. See
installation
for how to build the package, or use it as a submodule in a nother CMake project. - Require version v0.4 PermGroup, though it is available as a Git submodule.
- Change :cpp
make_default_visitor
to include many more visitors, to provide a quick way to get a reasonable algorithm configuration. - Change the style of search tree depictions from :cpp
stats_visitor
to use rounded rectangles as node shapes.
- Add the program
graph_canon_run
for easier invocation of canonicalization programs on batches of graphs. - Add script for downloading various graph collections:
download_graph_collections
. - Add the scripts
graph_canon_dreadnaut
andgraph_canon_bliss
for providing a common interface between the programs in this package, Bliss, nauty, and Traces. - Add
num_edges
support for :cppordered_graph
. - Add :cpp
as_range
helper function for converting Boost.Graph iterator pairs to ranges.
- #1: Add missing license (GPL).
- Add and update examples.
- Lots of documentation improvements.
- Require version v0.3 PermGroup.
- Add Schreier-Sims-based automorphism pruning.
- Documentation polishing.
- The interface of
aut_pruner_base
has been changed. Visitor::canon_new_best
has been changed.- Running the algorithm on an empty graph now works.
Second public version.