GSP
Quick Navigator

Search Site

Unix VPS
A - Starter
B - Basic
C - Preferred
D - Commercial
MPS - Dedicated
Previous VPSs
* Sign Up! *

Support
Contact Us
Online Help
Handbooks
Domain Status
Man Pages

FAQ
Virtual Servers
Pricing
Billing
Technical

Network
Facilities
Connectivity
Topology Map

Miscellaneous
Server Agreement
Year 2038
Credits
 

USA Flag

 

 

Man Pages
Graph::Traversal::DFS(3) User Contributed Perl Documentation Graph::Traversal::DFS(3)

Graph::Traversal::DFS - depth-first traversal of graphs

    use Graph;
    my $g = Graph->new;
    $g->add_edge(...);
    use Graph::Traversal::DFS;
    my $d = Graph::Traversal::DFS->new($g, %opt);
    $d->dfs; # Do the traversal.

With this class one can traverse a Graph in depth-first order.

The callback parameters %opt are explained in Graph::Traversal.

The following methods are available:
dfs
Traverse the graph in depth-first order. Returns all vertices traversed in post-order.

Graph::Traversal, Graph::Traversal::BFS, Graph.
2021-01-03 perl v5.32.1

Search for    or go to Top of page |  Section 3 |  Main Index

Powered by GSP Visit the GSP FreeBSD Man Page Interface.
Output converted with ManDoc.