Skip Menu |

This queue is for tickets about the Graph CPAN distribution.

Report information
The Basics
Id: 67213
Status: resolved
Priority: 0/
Queue: Graph

People
Owner: JHI [...] cpan.org
Requestors: clkao [...] clkao.org
Cc:
AdminCc:

Bug Information
Severity: (no value)
Broken in: (no value)
Fixed in: 0.95



CC: Chia-liang Kao <clkao [...] clkao.org>
Subject: [PATCH] pod fixes
Date: Mon, 4 Apr 2011 13:30:23 +0800
To: bug-Graph [...] rt.cpan.org
From: Chia-liang Kao <clkao [...] clkao.org>
--- lib/Graph/Traversal.pm | 2 +- lib/Graph/Traversal/BFS.pm | 6 +++--- lib/Graph/Traversal/DFS.pm | 4 ++-- 3 files changed, 6 insertions(+), 6 deletions(-) diff --git a/lib/Graph/Traversal.pm b/lib/Graph/Traversal.pm index f0f2d41..843eecc 100644 --- a/lib/Graph/Traversal.pm +++ b/lib/Graph/Traversal.pm @@ -471,7 +471,7 @@ or Graph::Traversal::BFS instead. my $g = Graph->new; $g->add_edge(...); use Graph::Traversal::...; - my $t = Graph::Traversal::...->new(%opt); + my $t = Graph::Traversal::...->new($g, %opt); $t->... =head1 DESCRIPTION diff --git a/lib/Graph/Traversal/BFS.pm b/lib/Graph/Traversal/BFS.pm index 2678f72..34dc7bc 100644 --- a/lib/Graph/Traversal/BFS.pm +++ b/lib/Graph/Traversal/BFS.pm @@ -31,7 +31,7 @@ Graph::Traversal::BFS - breadth-first traversal of graphs my $g = Graph->new; $g->add_edge(...); use Graph::Traversal::BFS; - my $b = Graph::Traversal::BFS->new(%opt); + my $b = Graph::Traversal::BFS->new($g, %opt); $b->bfs; # Do the traversal. =head1 DESCRIPTION @@ -46,9 +46,9 @@ The following methods are available: =over 4 -=item dfs +=item bfs -Traverse the graph in depth-first order. +Traverse the graph in breadth-first order. Returns all vertices traversed in post-order. =back diff --git a/lib/Graph/Traversal/DFS.pm b/lib/Graph/Traversal/DFS.pm index 4b109bd..ebeca38 100644 --- a/lib/Graph/Traversal/DFS.pm +++ b/lib/Graph/Traversal/DFS.pm @@ -31,7 +31,7 @@ Graph::Traversal::DFS - depth-first traversal of graphs my $g = Graph->new; $g->add_edge(...); use Graph::Traversal::DFS; - my $d = Graph::Traversal::DFS->new(%opt); + my $d = Graph::Traversal::DFS->new($g, %opt); $d->dfs; # Do the traversal. =head1 DESCRIPTION @@ -48,7 +48,7 @@ The following methods are available: =item dfs -Traverse the graph in depth-first order. +Traverse the graph in depth-first order. Returns all vertices traversed in post-order. =back -- 1.7.0.3.254.g4503b
Was addressed in release 0.95