Skip to content

A Python binding for the saucy algorithm for the graph automorphism problem

License

Notifications You must be signed in to change notification settings

KIT-IISM-EM/pysaucy

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

23 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

pysaucy

A Python binding for the saucy algorithm for the graph automorphism problem.

This package is no longer maintained. Have a look at pysaucy2.

Install

To install, run python setup.py install and ensure the source code of Saucy is found in the path ./saucy. The source code is available from the authors on request.

Known Issues

Handling of directed graphs is broken. Look at pysaucy2.

Documentation

The documentation can be found under https://KIT-IISM-EM.github.io/pysaucy/html/

Changes

0.3.3
  • Small fix in computation of orbit partition (did not effect the correct result)
0.3.2
  • Small fixes
  • Added more tests
0.3.1
  • Faster orbit partition
  • Karate graph used for test
0.3
  • Removed the use of global static variables
0.2.2
  • Added support for initially colored partition
0.2.1
  • Added more tests
  • Added doc strings
  • Added Sphinx documentation support
0.2
  • Removed old debug stuff
  • Added code comments
  • Added computation and return of the orbit partition
  • Many small fixes
0.1.1
  • Fix of a severe bug where not enough memory was allocated
  • Small fixes
0.1
  • First version