Concert is less than ideal in most circumstances.

Avoid reparsing a node.
Slightly slower on small graphs, much faster on large ones.

It was busted, and it's a nightmare to fix.
Added some missing doc

Cleaned up model loading
Added a test model
Fixed some bugs
Random model generation
Updated documentation
System export capabilities

Cycle search capabilities
Modified draw-eag to support filenames
Fixed missing data in CompositeGenerator
Added missing documentation
Included a way to operate on subgraphs

Implement an half decent algorithm.
Currently O(n^3), could possibly be brought down to O(n^2)

At first glance I'd wager it's O(n!)