.\" Automatically generated by Pod::Man v1.34, Pod::Parser v1.13
.\" ========================================================================
.de Sh \" Subsection heading
.de Sp \" Vertical space (when we can't use .PP)
.de Vb \" Begin verbatim text
.de Ve \" End verbatim text
.\" 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. | will give a
.\" real vertical bar. \*(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<>.
.ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p'
. 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
.\" If the F register is turned on, we'll generate index entries on stderr for
.\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
.\" entries marked with X<> in POD. Of course, you'll have to process the
.\" output yourself in some meaningful fashion.
. tm Index:\\$1\t\\n%\t"\\$2"
.\" For nroff, turn off justification. Always turn off hyphenation; it makes
.\" way too many mistakes in technical documents.
.\" 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
. ds #H ((1u-(\\\\n(.fu%2u))*.13m)
. \" simple accents for nroff and troff
. 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 \
.\" ========================================================================
.IX Title "Graph::Traversal 3"
.TH Graph::Traversal 3 "2004-04-04" "perl v5.8.0" "User Contributed Perl Documentation"
Graph::Traversal \- graph traversal
\& $s = Graph::Traversal->new($G, %param)
Returns a new graph search object for the graph \f(CW$G\fR
and the parameters \f(CW%param\fR.
Usually not used directly but instead via frontends like
Graph::DFS for depth-first searching and Graph::BFS for
\& $dfs = Graph::DFS->new($G, %param)
\& $bfs = Graph::BFS->new($G, %param)
\&\fI%param documentation to be written\fR
Resets a graph search object \f(CW$S\fR to its initial state.
\& $v = $s->next_preorder
Returns the next vertex in preorder of the graph
encapsulated within the search object \f(CW$s\fR.
.IX Item "next_postorder"
\& $v = $S->next_postorder
Returns the next vertex in postorder of the graph
encapsulated within the search object \f(CW$S\fR.
\& ($u, $v) = $s->next_edge
Returns the vertices of the next edge of the graph
encapsulated within the search object \f(CW$s\fR.
Returns all the vertices in preorder of the graph
encapsulated within the search object \f(CW$S\fR.
Returns all the vertices in postorder of the graph
encapsulated within the search object \f(CW$S\fR.
Returns all the edges of the graph
encapsulated within the search object \f(CW$S\fR.
Returns all the root vertices of the trees of
the graph encapsulated within the search object \f(CW$S\fR.
\&\*(L"The root vertices\*(R" is ambiguous: what really happens
is that either the roots from the previous search made
on the \f(CW$s\fR are returned; or a preorder search is done
and the roots of this search are returned.
\& %R = $S->_vertex_roots
Returns as a hash of ($vertex, index) pairs where index is an index
into the vertex_root list of the traversal.
\&\*(L"The root vertices\*(R" is ambiguous; see the documentation of the \fIroots()\fR
(This is the old \fIvertex_roots()\fR.)
Returns as a hash of ($vertex, \f(CW$root\fR) pairs all the vertices
and the root vertices of their search trees of the graph
encapsulated within the search object \f(CW$S\fR.
\&\*(L"The root vertices\*(R" is ambiguous; see the documentation of
the \fIroots()\fR method for more details.
(See also \fI_vertex_roots()\fR).
Copyright 1999, O'Reilly & Associates.
This code is distributed under the same copyright terms as Perl itself.
projects / OpenSPARC-T2-DV / blob