Package org.graffiti.plugins.algorithms.mst

Contains algorithms to compute the minimum spanning trees of directed and undirected graphs.

See:
          Description

Interface Summary
Heap<E,K> An ordered collection that allows clients to change the key of an element.
Heap.Entry<E,K> A heap entry.
 

Class Summary
AbstractHeap<E,K> This class provides a skeleton implementation of the Heap interface to minimize the effort required to implement this interface.
ArrayHeap<E,K>  
MSTPlugin Makes a set of minimum-spanning-tree algorithms available.
PrimsAlgorithm An implementation of Prims Algorithm for computing minimum spanning trees in undirected graphs; this class supports animations.
 

Package org.graffiti.plugins.algorithms.mst Description

Contains algorithms to compute the minimum spanning trees of directed and undirected graphs.



Generated at 2012-05-30 11:01:25 PM CEST