com.tensegrity.graph.view
Interface VisualGraphVisitor

public interface VisualGraphVisitor

This class is a functional visitor for subgraphs. It can be used via the method VisualGraphObjectContainer.visitSubgraphs(VisualGraphVisitor)

Version:

$Id: VisualGraphVisitor.java,v 1.4 2003/04/23 08:28:43 MichaelKegel Exp $

Author:

StepanRutz

Field Summary

static int	POST_ORDER Constant that tells about the order of graph traversal.
static int	PRE_ORDER Constant that tells about the order of graph traversal.

Method Summary

int	getOrder() Returns a constant that defines the order of graph traversal.
void	visit(VisualSubgraph visualsubgraph, VisualGraph visualgraph, VisualGraph parentvisualgraph, int level) Callback invoked during traversal of graph-hierarchies.

Field Detail

PRE_ORDER

public static final int PRE_ORDER

Constant that tells about the order of graph traversal.

See Also:

Constant Field Values

POST_ORDER

public static final int POST_ORDER

Constant that tells about the order of graph traversal.

See Also:

Constant Field Values

Method Detail

getOrder

public int getOrder()

Returns a constant that defines the order of graph traversal. This constant can be either PRE_ORDER, which means that subgraphs are visited after the actual node is visited, or POST_ORDER, which means that subgraphs are visited before the actual node is visited.

Returns:

int the constant that defines the order of graph traversal

visit

public void visit(VisualSubgraph visualsubgraph,
                  VisualGraph visualgraph,
                  VisualGraph parentvisualgraph,
                  int level)

Callback invoked during traversal of graph-hierarchies.

Parameters:

visualsubgraph - the VisualSubgraph that is currently being visited.

visualgraph - the VisualGraph that is currently being visited.

parentvisualgraph - the VisualGraph that is the parent of the currently visited visualgraph. May be null if there is no parent.

level - the depth of the recursion, which is measured from the beginning point of the recursion. This does not necessarily have to be the top-level-graph if the recursion was initiated from an already nested graph.