Package ca.uqac.lif.ecp.graphs

Class Summary

Class	Description
BreadthFirstSteinerTree<T extends Event,U>	Solves the Steiner tree problem by performing a breadth-first traversal of the graph from its root.
BreadthFirstVisitor<T extends Event>
CayleyGraphSolver<T extends Event,U>	Solves a problem on a generalized Cayley graph
DijkstraShortestPaths<T extends Event>
DijkstraSteinerTree<T extends Event,U>	Solves the directed Steiner tree problem by using a small variant of Dijkstra's algorithm
ForestNode<T extends Event>	Node in a spanning tree, as used in the union find algorithm for computing the minimum spanning tree of a graph.
GreedyHypergraphEdgeCover	Solves the hypergraph edge cover by a greedy approach.
Hypergraph	Implementation of an undirected hypergraph
Hypergraph.Hyperedge
HypergraphEdgeCover	Solver for the hypergraph edge covering problem.
LabelledGraph<T extends Event>	A graph with labels on its edges
ShortestPaths<T extends Event>
SpanningTree<T extends Event,U>	Solves the spanning tree problem.
SteinerTree<T extends Event,U>	Solves the directed Steiner tree problem.
TreeCollector<T extends Event>
UnionFindSpanningTree<T extends Event,U>	Solves the spanning tree problem using the union-find technique
Vertex<T extends Event>	Vertex of a Cayley Graph
VertexLabelling<V>	Labelling of a Graph.