Class Summary |
Aperiodic |
Algorithm for testing if a graph is aperiodic
method aperiodic() return the gcd of the circle
if this is 1, graph is aperiodic |
Circle |
Manages circles |
Graph |
Manage a graph strongly connected, aperiodic, 2 colored (blue and red)
run coloring() for change the coloring in order to have a synchronized word
Can be generated randomly if size n, or from a file
The syntax of the graph is :
n
i r b
with n size of the graph
and, for each node i, the red edge and the blue edge
Can be seen by dotty() |
NodeData |
Datas informations for one node |
Pairs |
Compute the pair automata in order to find a synchronize word |
PairsState |
States in the pair automata |
PrevNodes |
|
QuotientGraph |
Manage the quotient graph created in each iteration
The quotient graph is like the initial graph but collapses nodes with the same class |
StablePair |
Class for manage a stable pair
the two node of this pair gone on the same node by red
they are in the same class
stocked as a always the lower of the pair |
StronglyConnectedComponents |
usefull for check the strongly connected components of a graph |