Package aud.graph

Graph data structures and algorithms. More...

Packages
package	matrix
	sparse matrices for encoding adjacency

Classes
class	AbstractEdge
	Interface to edges of a graph. More...
class	AbstractGraph
	Interface to a graph. More...
class	AbstractNode
	Interface to nodes of a graph. More...
class	AdjacencyMatrix
	Sparse adjacency matrix. More...
class	GraphAM
	Graph implementation based on adjacency matrix. More...
class	SimpleEdge
	plain simple edge More...
class	SimpleNode
	plain simple node More...

Detailed Description

Graph data structures and algorithms.

Important note:

Some algorithm depend on storing elements of a graph such as nodes in a HashMap. These are in particular all algorithms using a PriorityQueue.

The current ("default") implementation relies on the default implementations of hashCode and equals, which use memory locations.

If you redefine any of these functions, you must ensure that they do not depend on the current state of the node (such as color) but solely on its identity!