From d128515f052cab9b83ecac8632722463ae44c2e4 Mon Sep 17 00:00:00 2001 From: doy Date: Sat, 7 Feb 2009 20:24:24 -0500 Subject: spanning tree tests shouldn't be using $traversal --- t/003-minimum-spanning-tree.t | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/t/003-minimum-spanning-tree.t b/t/003-minimum-spanning-tree.t index 7094588..aa68ea8 100644 --- a/t/003-minimum-spanning-tree.t +++ b/t/003-minimum-spanning-tree.t @@ -70,16 +70,16 @@ my $edge_calculator = sub { SKIP: { my $graph = Graph::Implicit->new($edge_calculator); skip "not implemented yet", 6 unless $graph->can('prim'); -for my $traversal (qw/prim/) { +for my $spanning_tree (qw/prim/) { for my $vertex (keys %mst) { my @visited; - my $tree = $graph->$traversal($vertex, sub { push @visited, $_[1] }); + my $tree = $graph->$spanning_tree($vertex, sub { push @visited, $_[1] }); cmp_bag(\@visited, $reachable{$vertex}, - "$traversal visits each node exactly once from $vertex"); + "$spanning_tree visits each node exactly once from $vertex"); ok(is_tree($tree), - "$traversal creates a tree from $vertex"); + "$spanning_tree creates a tree from $vertex"); cmp_deeply($tree, $mst{$vertex}, - "$traversal is the mst from $vertex"); + "$spanning_tree is the mst from $vertex"); } } } -- cgit v1.2.3