Package gishur.graph.core

Core classes for graph datastructures..

See:
          Description

Class Summary
AdjacentFilter A Filter, that may be used to filter adjacent GraphElements.
BFSCursor An implementation of the well-known Breath-First-Search algorithm via a TraverseAlgorithmCursor.
DFSCursor An implementation of the well-known Depth-First-Search algorithm via a TraverseAlgorithmCursor.
DijkstraCursor An implementation of the Single Source Shortest Paths problem using the Dijkstra algorithm via a TraverseAlgorithmCursor.
Edge The basic Edge class for arbitrary Graphs.
Flow Public inner class to represent the data of an Edge in a FlowNetwork.
Graph  
GraphCursor The basic Cursor class to traverse arbitrary Graphs.
GraphElement Abstract basic class for Node, Edge and Graph.
GraphElementCursor A GraphCursor, that enumerates the connected GraphElements of a given GraphElement.
GraphFileFormat This abstract class defines a simple streaming format for Graphs.
NameFilter A Filter class which stores Strings.
Node Basic node class for Graphs.
TraverseAlgorithmCursor This class should be used to implement Graph-Traversals.
TraverseCursor A traversal-cursor, that extends GraphCursor and uses a given TraverseAlgorithmCursor for navigation. For an example we use the BFSCursor class that implements the Breath-First-Search algorithm: BFSCursor bfs=new BFCursor(graph); TraverseCursor cursor=new TraverseCursor(bfs); for (cursor.top();cursor.valid();cursor.next()) { ...
WeightComparitor A class which compares Edges according to their weight.
 

Exception Summary
GraphException Handles all exceptions trigger by invalid modifications of nodes, edges and graphs.
 

Package gishur.graph.core Description

Core classes for graph datastructures..