Package salvo.jesus.graph.algorithm

Class Summary

Class	Description
BreadthFirstTraversal	A concrete subclass of GraphTraversal that uses breadth-first search in traversing a graph.
CycleDetectionAlgorithm	Abstract class for any algorithm implementing cycle detection on a Graph (directed or undirected).
CycleDetectionAlgorithmDFS	An implementation of CycleDetectionAlgorithm via DFS.
DepthFirstDirectedGraphTraversal	A concrete subclass of GraphTraversal that uses depth-first search in traversing a directed graph.
DepthFirstGraphTraversal	A concrete subclass of GraphTraversal that uses depth-first search in traversing a graph.
EulerCircleFinder	This class finds an Euler circle in a graph.
GraphContractionAlgorithm	GraphContraction is an algorithm class for managing a series of contractions on a graph (directed or undirected).
GraphTraversal	Abstract class for an algorithm implementing graph traversal.
GraphUnionAlgorithm	GraphUnionAlgorithm is an algorithm class for managing the operation of taking the union of graphs (directed or undirected).
MinimumSpanningTreeAlgorithm	Abstract class for an algorithm implementing the minimum spanning tree.
MinimumSpanningTreeKruskalAlgorithm	A contrete implementation of the MinimumSpanningTreeAlgorithm using Kruskal's method.
ShortestPathAlgorithm	Abstract class for implementing the shortest path algorithm.
ShortestPathDijkstraAlgorithm	A concrete implementation of ShortestPathAlgorithm using Dijkstra's method.
TopologicalSorting	A concrete subclass of GraphTraversal that performs a topological sort against a directed acyclic graph.