---
name: "GO::Model::TreeIterator"
section: "3pm"
platform: "linux"
package: "libgo-perl"
version: "0.15-10"
release: "Debian 13 (Trixie)"
platforms: ["linux"]
url: "https://new.carta.tech/GO::Model::TreeIterator"
---

# GO::Model::TreeIterator(3pm)

## NAME

```
  GO::Model::GraphIterator - wraps 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    -
```