Dover v0.31

Several bug fixes.

Dover v0.3

Added support for directed graphs in various algorithms.
Added significant graph edit distance algorithms.
Added other graph similarity algorithms.

Dover v0.2.1

Minor bug fix.

Some graphs may not be saved with a name. This is fixed.
Graphs being loaded without a name crash. They are now assigned a name to fix this.

Dover v0.2

This is an update to v0.1.

Major Changes

• Approximate Subgraph Isomorphism accepts Comparators. This allows a user to modify the code easier to create their own Comparators.
• Graph Edit Distance Approximation now considers time edges. Graphs which would be isomorphic if time edges are considered normal edges, are now no longer isomorphic. This allows the more accurate classification of behaviour subgraphs.

Minor Changes

• Public Exact Motif Finding methods renamed to be less cryptic.
• If Graph Isomorphism is run over a disconnected graph, Exception is thrown and caught rather than displaying an error message.

Dover Delivery

Dover as delivered at the end of the project