Package javautils.graph.templates

Template Methods [Gamma1995] for graph algorithms.

See:
Description

Class Summary

AdjacentIterTemplate	An abstract Template Method [Gamma1995] for iterating a graph based on the adjacency structure of the graph.
BfsTemplate	An abstract Template Method [Gamma1995] for breadth-first search [Cormen2001].
BfsTemplateTest	A [JUnit] test for BfsTemplate.
DfsTemplate	An abstract Template Method [Gamma1995] for depth-first search [Cormen2001].
DfsTemplateTest	A [JUnit] test for DfsTemplate.
NodesAndEdgesIterTemplate	An abstract Template Method [Gamma1995] for iterating over all nodes and edges of a graph.
TimedSearchTemplate	An abstract Template Method [Gamma1995] for searching directed graphs in a timed fashion.

Package javautils.graph.templates Description

Template Methods [Gamma1995] for graph algorithms.

The template methods in this package were designed after analyzing the generic graph algorithms in the Boost Graph Library (BGL) [Siek2001]. Note that the BGL and JavaUtils implement generic graph algorithms somewhat differently:

• JavaUtils define Template Methods rather than Visitors [Gamma1995] like BGL. Template methods are comparatively more convenient to use in Java than in C++.
• The overridable event point methods defined by JavaUtils template methods are slightly different from the member functions defined by BGL. In particular, the BFS Visitor of BGL and the BfsTemplate have different semantics for finish_vertex() and finishNode(), respectively. The reason for these differences is that the current semantics of JavaUtils seem simpler to the author.