Class
Tree
Deprecated
Index
Help
PREV NEXT
FRAMES
NO FRAMES
A
B
C
E
G
I
L
M
N
O
R
S
T
U
A
anyInEdge()
- Method in class
Node
Returns a random incoming edge.
anyOutEdge()
- Method in class
Node
Returns a random outgoing edge.
B
BipartiteGraph
- class
BipartiteGraph
.
A repręsentation of a bipartite graph.
BipartiteGraph()
- Constructor for class
BipartiteGraph
C
calculateMaximumMatching(BipartiteGraph)
- Static method in class
MaximumMatching
Calculates the maximum matching.
container()
- Method in interface
Locator
Returns the container of the element.
E
Edge
- class
Edge
.
A representation of an edge.
Edge(Node, Node)
- Constructor for class
Edge
Creates an edge from the
from
-node to the
to
-node.
element()
- Method in interface
Locator
Returns the element.
elements()
- Method in class
Sequence
Makes an Enumeration of all the elements of the sequence.
G
getMatches()
- Method in class
BipartiteGraph
Get a string representation of the edges that are part of the matching.
I
inDegree()
- Method in class
Node
Get the number of incoming edges.
inEdges()
- Method in class
Node
Get the incoming edges.
insertLast(Object)
- Method in class
Sequence
Inserts an object at the last posistion of the sequence.
isContained()
- Method in interface
Locator
Returns true if the element is still contained.
L
loadDataFromFile(String)
- Method in class
BipartiteGraph
Loads an input graph from a file Input data are read from a file and the corresponding graph is constructed.
Locator
- interface
Locator
.
Locator.java Created: Fri Mar 31 09:43:51 2000
M
main(String[])
- Static method in class
MaxParring
Starter programmet.
main(String[])
- Static method in class
MaximumMatching
Starts the program.
main(String[])
- Static method in class
RandomGraf
Runs the program.
MaximumMatching
- class
MaximumMatching
.
The main program.
MaximumMatching()
- Constructor for class
MaximumMatching
MaxParring
- class
MaxParring
.
Hovedprogrammet.
MaxParring()
- Constructor for class
MaxParring
N
Node
- class
Node
.
A representation of a node.
Node(String, int)
- Constructor for class
Node
Creates a new Node.
O
outDegree()
- Method in class
Node
Get the number of outgoing edges.
outEdges()
- Method in class
Node
Get the outgoing edges.
R
RandomGraf
- class
RandomGraf
.
RandomGraf()
- Constructor for class
RandomGraf
Produces a random bipartite graph
remove()
- Method in class
Edge
Removes
this
edge.
remove(Locator)
- Method in class
Sequence
Removes an element from the sequence given that elemnts locator.
removeColors()
- Method in class
BipartiteGraph
Colors the nodes white All the nodes composing the graph are run through.
removeLast()
- Method in class
Sequence
Removes the last element in the sequence.
runTransitionSystem()
- Method in class
BipartiteGraph
Run the graph coloring algorithm.
S
Sequence
- class
Sequence
.
A sequence.
Sequence()
- Constructor for class
Sequence
Constructs an empty sequence.
size()
- Method in class
Sequence
SkrivGraf(String, int, int, int)
- Static method in class
RandomGraf
Produces a file containg a random bipartite graph
T
toLaTeX(String)
- Method in class
BipartiteGraph
Produces a graphical LaTeX output of a graph.
toLaTeX(String, boolean)
- Method in class
BipartiteGraph
Produces a graphical LaTeX output of a graph.
toString()
- Method in class
BipartiteGraph
Returns a string representation of the graph.
toString()
- Method in class
Edge
Produce a stringrepresentation of a edge.
toString()
- Method in class
Node
The string representation is just the given name.
toString()
- Method in class
Sequence
Make a string representation of the sequence.
turnEdges(Node)
- Method in class
BipartiteGraph
Turns the edges around.
U
usage()
- Static method in class
MaximumMatching
Prints a short usage message.
usage()
- Static method in class
RandomGraf
Prints a small userguide to the standard output.
A
B
C
E
G
I
L
M
N
O
R
S
T
U
Class
Tree
Deprecated
Index
Help
PREV NEXT
FRAMES
NO FRAMES