Efficient path graph (P-graph) implementation to assist in finding all cycles.

Signed-off-by: Egon Willighagen <egonw@users.sourceforge.net>
Tool to compute all simple cycles using the new path graph implementations.

Signed-off-by: Egon Willighagen <egonw@users.sourceforge.net>
When putting vertices in a cycle - start and end vertices are now the same.

Signed-off-by: Egon Willighagen <egonw@users.sourceforge.net>
Store cyclic walks the same start/end vertex - required converting a lot of the tests..

Signed-off-by: Egon Willighagen <egonw@users.sourceforge.net>