Package org.geotools.graph.traverse

Defines Graph traversals based on Visitor pattern.

See:
Description

Interface Summary

DijkstraTraversal.CostFunction	Represents a cost function to be used by dijkstras algorithm to calculate node costs.
GraphTraversal	The GraphTraversal interface represents an algorithm with which to traverse or walk the graph.
GraphVisitor	An interface in which to implement a visitor pattern with components of a graph.
GraphWalker	A GraphWalker walks a graph via a GraphTraversal.

Class Summary

AbstractGraphTraversal	An abstract implementation of GraphTraversal.
BasicGraphTraversal	A very simple traversal in which a single pass is made over the components of the graph.
BreadthFirstTraversal	Performs a Breadth First Traversal of the graph.
DepthFirstTraversal	Performs a Depfth First traversal of the graph.
DijkstraTraversal	Traverses a graph using Dijkstras shortest path alorithm.
ReverseDepthFirstTraversal
SimpleGraphWalker	A simple implentation of GraphWalker that decorates a GraphVisitor.
SourceGraphTraversal	A GraphTraversal that is intened to start from a single graph componenet.
TopologicalTraversal	DOCUMENT ME!

Package org.geotools.graph.traverse Description

Defines Graph traversals based on Visitor pattern.

Allows access your Graph using a walker (GOF vistor pattern). Precanned Walkers exist for both edge and node based traversals.

The orgional graph package has been developed using the JUMP Feature API. Its intension is to be able to aid automated skeletonization of water bodies by computing directionality of generated skeletons. The work for the orgiional JUMP based library has been funded by the BC Proventional Government department of BMGS.

This library has been ported to geotools2 as part of the VWFS project sponcered by Geo Innovations. If all goes well this will be included in a future release of geotools2.