Circle(int) -
Constructor for class fr.umlv.roadcoloring.graph.Circle
coloring() -
Method in class fr.umlv.roadcoloring.graph.Graph
eventually change the colloring of the graph in order to be synchronizing
compute the quotient graph until it's a size > 1
compute the quotient from the classes.
find and return a stable pair in the graph
compute the distance of each nodes to circles
made a threatman exchange if necessary for finding a stable pair
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()
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