0.7.0

This release introduces several new features, changes some existing functionality, and improves the documentation. The changes in this release were made by Wilf A. Wilson.

New Features in Version 0.7.0

• This release contains a new technique for encoding a vertex-coloured multidigraph as a vertex-coloured (undirected) graph while preserving the automorphism group, in order to calculate the automorphism group and canonical labelling using bliss. This enables the following functionality:

  • the operations AutomorphismGroup and DigraphCanonicalLabelling for a digraph and a vertex-colouring now accept a multidigraph as their first argument;
  • the operations IsIsomorphicDigraph and IsomorphismDigraphs now accept multidigraphs, and they also accept vertex-colourings as optional arguments.

• This release add new functionality related to undirected spanning trees and undirected spanning forests:

  • the property IsUndirectedForest is introduced;
  • the attributes UndirectedSpanningTree and UndirectedSpanningForest are introduced; and
  • the operations IsUndirectedSpanningTree and IsUndirectedSpanningForest are introduced.

Altered Behaviour in Version 0.7.0

• The behaviour of IsSubdigraph is changed in the case that it is given one or two multidigraphs.
• The one-argument version of the operation DigraphColouring (and its synonym, DigraphColoring) is now an attribute.