Package gishur.graph.algorithms

A collection of graph algorithms.

See:
          Description

Class Summary
BellmanFord An implementation of the Single Source Shortest Paths problem using the Dijkstra algorithm via a TraverseAlgorithmCursor.
BFS An Algorithm class to perform the Breadth-first search algorithm on an arbitrary Graph.
DFS Algorithm class performing 'Depth-first search' on a given Graph g.
Dijkstra Description of Dijkstra Algorithm ...
DijkstraAlgo An gishur.core.algorithm.Algorithm class to perform the Single Source Shortest Path algorithm on an arbitrary Graph.
MSTKruskal Kruskal's algorithm to find the minimum-spanning-tree.
 

Exception Summary
NegativeCycleException This Exception is thrown by the BellmanFord-Algorithm, when a negative cycle is detected in the Graph.
 

Package gishur.graph.algorithms Description

A collection of graph algorithms.