.\" Automatically generated by Pod::Man 2.27 (Pod::Simple 3.28) .\" .\" Standard preamble: .\" ======================================================================== .de Sp \" Vertical space (when we can't use .PP) .if t .sp .5v .if n .sp .. .de Vb \" Begin verbatim text .ft CW .nf .ne \\$1 .. .de Ve \" End verbatim text .ft R .fi .. .\" Set up some character translations and predefined strings. \*(-- will .\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left .\" double quote, and \*(R" will give a right double quote. \*(C+ will .\" give a nicer C++. Capital omega is used to do unbreakable dashes and .\" therefore won't be available. \*(C` and \*(C' expand to `' in nroff, .\" nothing in troff, for use with C<>. .tr \(*W- .ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p' .ie n \{\ . ds -- \(*W- . ds PI pi . if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch . if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\" diablo 12 pitch . ds L" "" . ds R" "" . ds C` "" . ds C' "" 'br\} .el\{\ . ds -- \|\(em\| . ds PI \(*p . ds L" `` . ds R" '' . ds C` . ds C' 'br\} .\" .\" Escape single quotes in literal strings from groff's Unicode transform. .ie \n(.g .ds Aq \(aq .el .ds Aq ' .\" .\" If the F register is turned on, we'll generate index entries on stderr for .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index .\" entries marked with X<> in POD. Of course, you'll have to process the .\" output yourself in some meaningful fashion. .\" .\" Avoid warning from groff about undefined register 'F'. .de IX .. .nr rF 0 .if \n(.g .if rF .nr rF 1 .if (\n(rF:(\n(.g==0)) \{ . if \nF \{ . de IX . tm Index:\\$1\t\\n%\t"\\$2" .. . if !\nF==2 \{ . nr % 0 . nr F 2 . \} . \} .\} .rr rF .\" .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2). .\" Fear. Run. Save yourself. No user-serviceable parts. . \" fudge factors for nroff and troff .if n \{\ . ds #H 0 . ds #V .8m . ds #F .3m . ds #[ \f1 . ds #] \fP .\} .if t \{\ . ds #H ((1u-(\\\\n(.fu%2u))*.13m) . ds #V .6m . ds #F 0 . ds #[ \& . ds #] \& .\} . \" simple accents for nroff and troff .if n \{\ . ds ' \& . ds ` \& . ds ^ \& . ds , \& . ds ~ ~ . ds / .\} .if t \{\ . ds ' \\k:\h'-(\\n(.wu*8/10-\*(#H)'\'\h"|\\n:u" . ds ` \\k:\h'-(\\n(.wu*8/10-\*(#H)'\`\h'|\\n:u' . ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'^\h'|\\n:u' . ds , \\k:\h'-(\\n(.wu*8/10)',\h'|\\n:u' . ds ~ \\k:\h'-(\\n(.wu-\*(#H-.1m)'~\h'|\\n:u' . ds / \\k:\h'-(\\n(.wu*8/10-\*(#H)'\z\(sl\h'|\\n:u' .\} . \" troff and (daisy-wheel) nroff accents .ds : \\k:\h'-(\\n(.wu*8/10-\*(#H+.1m+\*(#F)'\v'-\*(#V'\z.\h'.2m+\*(#F'.\h'|\\n:u'\v'\*(#V' .ds 8 \h'\*(#H'\(*b\h'-\*(#H' .ds o \\k:\h'-(\\n(.wu+\w'\(de'u-\*(#H)/2u'\v'-.3n'\*(#[\z\(de\v'.3n'\h'|\\n:u'\*(#] .ds d- \h'\*(#H'\(pd\h'-\w'~'u'\v'-.25m'\f2\(hy\fP\v'.25m'\h'-\*(#H' .ds D- D\\k:\h'-\w'D'u'\v'-.11m'\z\(hy\v'.11m'\h'|\\n:u' .ds th \*(#[\v'.3m'\s+1I\s-1\v'-.3m'\h'-(\w'I'u*2/3)'\s-1o\s+1\*(#] .ds Th \*(#[\s+2I\s-2\h'-\w'I'u*3/5'\v'-.3m'o\v'.3m'\*(#] .ds ae a\h'-(\w'a'u*4/10)'e .ds Ae A\h'-(\w'A'u*4/10)'E . \" corrections for vroff .if v .ds ~ \\k:\h'-(\\n(.wu*9/10-\*(#H)'\s-2\u~\d\s+2\h'|\\n:u' .if v .ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'\v'-.4m'^\v'.4m'\h'|\\n:u' . \" for low resolution devices (crt and lpr) .if \n(.H>23 .if \n(.V>19 \ \{\ . ds : e . ds 8 ss . ds o a . ds d- d\h'-1'\(ga . ds D- D\h'-1'\(hy . ds th \o'bp' . ds Th \o'LP' . ds ae ae . ds Ae AE .\} .rm #[ #] #H #V #F C .\" ======================================================================== .\" .IX Title "GO::Model::GraphIterator 3pm" .TH GO::Model::GraphIterator 3pm "2014-02-01" "perl v5.18.2" "User Contributed Perl Documentation" .\" For nroff, turn off justification. Always turn off hyphenation; it makes .\" way too many mistakes in technical documents. .if n .ad l .nh .SH "NAME" .Vb 1 \& GO::Model::GraphIterator \- Graph iterator .Ve .SH "SYNOPSIS" .IX Header "SYNOPSIS" .Vb 2 \& $it = $graph\->create_iterator; \& # returns a GO::Model::GraphIterator object \& \& while (my $ni = $it\->next_node_instance) { \& $depth = $ni\->depth; \& $term = $ni\->term; \& $reltype = $ni\->parent_rel\->type; \& printf \& "%s %8s Term = %s (%s) // depth=%d\en", \& "\-\-\-\-" x $depth, \& $reltype, \& $term\->name, \& $term\->public_acc, \& $depth; \& } .Ve .SH "DESCRIPTION" .IX Header "DESCRIPTION" .SH "SEE ALSO" .IX Header "SEE ALSO" GO::Model::Graph .PP GO::Model::GraphNodeInstance .SS "order" .IX Subsection "order" .Vb 3 \& Usage \- $graphiter\->order("breadth"); \& Returns \- string \& Args \- string .Ve .PP gets/sets traversal order; breadth or depth; default is depth .SS "direction" .IX Subsection "direction" .Vb 3 \& Usage \- $graphiter\->direction("up"); \& Returns \- string \& Args \- string .Ve .PP gets/sets direction; default is \*(L"down\*(R" .SS "compact" .IX Subsection "compact" .Vb 3 \& Usage \- $graphiter\->compact(1); \& Returns \- bool \& Args \- bool .Ve .PP set this if you dont want relationships to be traversed twice; this gives a more compact tree representation of the graph .SS "reltype_filter" .IX Subsection "reltype_filter" .Vb 3 \& Usage \- $graphiter\->reltype_filter(qw(is_a part_of)) \& Returns \- array \& Args \- array .Ve .PP by default, all relationship types are treated as transitive, and will be traversed by the iterator .PP sometimes you dont want to traverse all relations, even if they are transitive. For example, when answering the query \*(L"find all genes expressed in the embryo\*(R" you way want subtypes of embryo and parts of the embryo but not things that develop_from the embryo. .PP For more details, see .SS "reset_cursor" .IX Subsection "reset_cursor" .Vb 3 \& Usage \- \& Returns \- \& Args \- .Ve .SS "next_node" .IX Subsection "next_node" .Vb 3 \& Usage \- \& Returns \- GO::Model::Term \& Args \- .Ve .SS "next_node_instance" .IX Subsection "next_node_instance" .Vb 3 \& Usage \- \& Returns \- GO::Model::GraphNodeInstance \& Args \- .Ve .SS "flatten" .IX Subsection "flatten" .Vb 3 \& Usage \- \& Returns \- \& Args \- .Ve .SS "_sortby_pos_in_list" .IX Subsection "_sortby_pos_in_list" Careful, this sort function work on Term objects, not GraphNodeInstance objects. Comparison is done by the name of the term.