A B C D E F G I M N P Q R S T V

A

addNode(int) - Method in class fr.umlv.roadcoloring.graph.PairsState
Add a node in the state
Aperiodic - Class in fr.umlv.roadcoloring.graph
Algorithm for testing if a graph is aperiodic method aperiodic() return the gcd of the circle if this is 1, graph is aperiodic
Aperiodic(Graph) - Constructor for class fr.umlv.roadcoloring.graph.Aperiodic
constructor
aperiodic() - Method in class fr.umlv.roadcoloring.graph.Aperiodic
perform the test

B

BLUEEDGE - Static variable in class fr.umlv.roadcoloring.graph.Graph
 
browse(int, String) - Method in class fr.umlv.roadcoloring.graph.Graph
Browse the word in the graph, start from the node graph Word is a succession of R or B.

C

Circle - Class in fr.umlv.roadcoloring.graph
Manages circles
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.
components() - Method in class fr.umlv.roadcoloring.graph.StronglyConnectedComponents
compute the strongly connected components
computeIndexes() - Method in class fr.umlv.roadcoloring.graph.QuotientGraph
Run the computation of indexes, i.e. the levels or each nodes (distance to the circle, root of the tree) fill the data tab.

D

dotty() - Method in class fr.umlv.roadcoloring.graph.Graph
launch dotty and print the graph

E

edgeSwap(int) - Method in class fr.umlv.roadcoloring.graph.Graph
flip the edges of the node
edgeSwap(int) - Method in class fr.umlv.roadcoloring.graph.QuotientGraph
flip the edge of node
equals(HashSet<Integer>) - Method in class fr.umlv.roadcoloring.graph.PairsState
 

F

findStablePair() - Method in class fr.umlv.roadcoloring.graph.QuotientGraph
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
fr.umlv.roadcoloring.graph - package fr.umlv.roadcoloring.graph
 
fr.umlv.roadcoloring.main - package fr.umlv.roadcoloring.main
 

G

gcd(int, int) - Static method in class fr.umlv.roadcoloring.main.Tools
 
get(int, byte) - Method in class fr.umlv.roadcoloring.graph.Graph
Get the next by color of index
getA() - Method in class fr.umlv.roadcoloring.graph.StablePair
 
getAllPred(int, byte) - Method in class fr.umlv.roadcoloring.graph.PrevNodes
 
getB() - Method in class fr.umlv.roadcoloring.graph.StablePair
 
getBlue(int) - Method in class fr.umlv.roadcoloring.graph.Graph
get the next by blue for index
getCircle() - Method in class fr.umlv.roadcoloring.graph.NodeData
Get the reached circle (it's own if node in on the circle, the reached circle of tree else)
getCircleNumber() - Method in class fr.umlv.roadcoloring.graph.Circle
 
getClasses() - Method in class fr.umlv.roadcoloring.graph.Graph
get the classes for each node
getFromNode(int) - Method in class fr.umlv.roadcoloring.graph.PrevNodes
 
getLevel() - Method in class fr.umlv.roadcoloring.graph.NodeData
return the circle's distance of the node (0 if on the circle)
getNodeClass(int) - Method in class fr.umlv.roadcoloring.graph.Graph
get the class of a node from the initial graph -1 is the status of a node not in a class (so return herself)
getNodes() - Method in class fr.umlv.roadcoloring.graph.PairsState
 
getOnePred(int, byte) - Method in class fr.umlv.roadcoloring.graph.PrevNodes
 
getQuotientSize() - Method in class fr.umlv.roadcoloring.graph.QuotientGraph
Number of node in the quotient graph
getRed(int) - Method in class fr.umlv.roadcoloring.graph.Graph
get the next by red for index
getRoot() - Method in class fr.umlv.roadcoloring.graph.Circle
 
getRootAbsolute() - Method in class fr.umlv.roadcoloring.graph.NodeData
get the number of the node root
getSize() - Method in class fr.umlv.roadcoloring.graph.Circle
 
getSize() - Method in class fr.umlv.roadcoloring.graph.Graph
get graph size
getSucessorByRed(int, int) - Method in class fr.umlv.roadcoloring.graph.Graph
browse the red edge len time from the start node
getSynchronizedWord() - Method in class fr.umlv.roadcoloring.graph.Pairs
Compute the pair automata in each step and return the synchronize word for the graph
getWord() - Method in class fr.umlv.roadcoloring.graph.PairsState
 
Graph - Class in fr.umlv.roadcoloring.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()
Graph(int, String) - Constructor for class fr.umlv.roadcoloring.graph.Graph
Generate a randomly acceptable graph of size n
Graph(Graph) - Constructor for class fr.umlv.roadcoloring.graph.Graph
Create a graph from another graph create array but not the edges
Graph(String) - Constructor for class fr.umlv.roadcoloring.graph.Graph
Create a graph from a file

I

isAcceptable() - Method in class fr.umlv.roadcoloring.graph.Graph
tell if the graph is acceptable (strongly connected and aperiodic)
isAperiodic() - Method in class fr.umlv.roadcoloring.graph.Graph
tell if the graph is aperiodic
isCompleted() - Method in class fr.umlv.roadcoloring.graph.Circle
 
isStronglyConnected() - Method in class fr.umlv.roadcoloring.graph.Graph
test if this graph is strongly connected

M

Main - Class in fr.umlv.roadcoloring.main
Main class for launch the algorithm
Main() - Constructor for class fr.umlv.roadcoloring.main.Main
 
main(String[]) - Static method in class fr.umlv.roadcoloring.main.Main
launch usage : -n n [generator] for generate a graph of n nodes -f filename, generate a graph from a file

N

NodeData - Class in fr.umlv.roadcoloring.graph
Datas informations for one node
NodeData(Circle, int, int) - Constructor for class fr.umlv.roadcoloring.graph.NodeData
 

P

Pairs - Class in fr.umlv.roadcoloring.graph
Compute the pair automata in order to find a synchronize word
Pairs(Graph) - Constructor for class fr.umlv.roadcoloring.graph.Pairs
 
PairsState - Class in fr.umlv.roadcoloring.graph
States in the pair automata
PairsState() - Constructor for class fr.umlv.roadcoloring.graph.PairsState
New empty state
PairsState(HashSet<Integer>, String) - Constructor for class fr.umlv.roadcoloring.graph.PairsState
New state with a set of nodes and a word for going to this state
PrevNodes - Class in fr.umlv.roadcoloring.graph
 
PrevNodes(Graph, HashSet<Integer>) - Constructor for class fr.umlv.roadcoloring.graph.PrevNodes
 
putNode(int) - Method in class fr.umlv.roadcoloring.graph.Circle
add a node in the circle use to know when the circle is completed

Q

QuotientGraph - Class in fr.umlv.roadcoloring.graph
Manage the quotient graph created in each iteration The quotient graph is like the initial graph but collapses nodes with the same class
QuotientGraph(Graph) - Constructor for class fr.umlv.roadcoloring.graph.QuotientGraph
Construct the quotient graph from the initial graph (reduce nodes)

R

REDEDGE - Static variable in class fr.umlv.roadcoloring.graph.Graph
 

S

setBlue(int, int) - Method in class fr.umlv.roadcoloring.graph.Graph
set the next by blue of index
setRed(int, int) - Method in class fr.umlv.roadcoloring.graph.Graph
set the next by red of index
setRoot(int) - Method in class fr.umlv.roadcoloring.graph.Circle
 
StablePair - Class in fr.umlv.roadcoloring.graph
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
StablePair(int, int) - Constructor for class fr.umlv.roadcoloring.graph.StablePair
 
StronglyConnectedComponents - Class in fr.umlv.roadcoloring.graph
usefull for check the strongly connected components of a graph
StronglyConnectedComponents(Graph) - Constructor for class fr.umlv.roadcoloring.graph.StronglyConnectedComponents
Constructor

T

toDot() - Method in class fr.umlv.roadcoloring.graph.Graph
usefull for dotty
Tools - Class in fr.umlv.roadcoloring.main
 
Tools() - Constructor for class fr.umlv.roadcoloring.main.Tools
 
toString() - Method in class fr.umlv.roadcoloring.graph.Circle
 
toString() - Method in class fr.umlv.roadcoloring.graph.Graph
 
toString() - Method in class fr.umlv.roadcoloring.graph.NodeData
 
toString() - Method in class fr.umlv.roadcoloring.graph.StablePair
 

V

verifySyncWord(String) - Method in class fr.umlv.roadcoloring.graph.Graph
Check if the word synchronize the graph (if browse the word from each node, they're going on the same node)

A B C D E F G I M N P Q R S T V