The Perl Toolchain Summit needs more sponsors. If your company depends on Perl, please support this very important event.

NAME

  GO::Model::GraphIterator;

SYNOPSIS

DESCRIPTION

This is a hack. It wraps GO::Model::GraphIterator and provides a tree like iteration, rather than a graph-like iteration.

This is done by giving TreeIterator a template array.

The array looks like this :

[ [3674, 'isa', 3673], [9277, 'isa', 5618] ]

3674 is selected iff it is the child of 3673. 9277 is selected iff it is the child of 5618.

order

  Usage   - $graphiter->order("breadth");
  Returns - string
  Args    - string

gets/sets traversal order; breadth or depth; default is depth

direction

  Usage   - $graphiter->direction("up");
  Returns - string
  Args    - string

gets/sets direction; default is "down"

reset_cursor

  Usage   -
  Returns - GO::Model::Term
  Args    -

next_node

  Usage   -
  Returns - GO::Model::Term
  Args    -

set_bootstrap_mode

  Usage   -
  Returns - 
  Args    -

get_bootstrap_mode

  Usage   -
  Returns - 
  Args    -

get_current_path

  Usage   -
  Returns - array ref
  Args    - none

next_node_instance

  Usage   -
  Returns - GO::Model::GraphNodeInstance
  Args    -