net.sf.octet.traversal
Class HanserCycleTraverser

java.lang.Object
  net.sf.octet.traversal.HanserCycleTraverser

All Implemented Interfaces:

CycleTraverser

public class HanserCycleTraverser

extends java.lang.Object

implements CycleTraverser

An implementation of the CycleTraverser interface that traverses all cycles in an AtomGraph.

HanserCycleTraverser uses the algorithm originally described by Hanser (Hanser et al. J. Chem. Inf. Comput. Sci. 1996, 36, 1146-1152). The key feature of this algorithm is the use of a collapsing P-Graph, which is implemented here as a private inner class.

Author:

Richard Apodaca

Nested Class Summary

Nested classes inherited from class net.sf.octet.traversal.CycleTraverser

CycleTraverser.Handler

Constructor Summary

HanserCycleTraverser()

Method Summary

void	traverse(AtomGraph graph, CycleTraverser.Handler handler) Traverses graph while notifying handler of traversal events.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

HanserCycleTraverser

public HanserCycleTraverser()

Method Detail

traverse

public void traverse(AtomGraph graph,
                     CycleTraverser.Handler handler)

Description copied from interface: CycleTraverser

Traverses graph while notifying handler of traversal events.

Specified by:

traverse in interface CycleTraverser

Parameters:

graph - the AtomGraph to traverse

handler - receives traversal events