1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63
|
package Graph::DFS;
use strict;
local $^W = 1;
use Graph::Traversal;
use vars qw(@ISA);
@ISA = qw(Graph::Traversal);
=head1 NAME
Graph::DFS - graph depth-first search
=head1 SYNOPSIS
B<see description>
=head1 DESCRIPTION
=over 4
=cut
=pod
=item new
$dfs = Graph::DFS->new($G, %param)
Returns a new depth-first search object for the graph $G
and the (optional) parameters %param.
=cut
sub new {
my $class = shift;
my $graph = shift;
Graph::Traversal::new( $class,
$graph,
current =>
sub { $_[0]->{ active_list }->[ -1 ] },
finish =>
sub { pop @{ $_[0]->{ active_list } } },
@_);
}
=pod
=back
See also C<Graph::Traversal>.
=head1 COPYRIGHT
Copyright 1999, O'Reilly & Associates.
This code is distributed under the same copyright terms as Perl itself.
=cut
1;
|