diff options
| author | Jesse Luehrs <doy@tozt.net> | 2009-06-21 14:01:40 -0500 |
|---|---|---|
| committer | Jesse Luehrs <doy@tozt.net> | 2009-06-21 14:01:40 -0500 |
| commit | daba44bc0993ecc2653eeb876183bde1a00597e7 (patch) | |
| tree | 554cc31a07b822b37ef297b389615a066c6f5718 | |
| parent | 140d103796ebf22b0e951034c6c1152d4271eae7 (diff) | |
| download | graph-implicit-daba44bc0993ecc2653eeb876183bde1a00597e7.tar.gz graph-implicit-daba44bc0993ecc2653eeb876183bde1a00597e7.zip | |
vertices() and edges() require a vertex argument
| -rw-r--r-- | lib/Graph/Implicit.pm | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/Graph/Implicit.pm b/lib/Graph/Implicit.pm index b9a3556..9d8c43c 100644 --- a/lib/Graph/Implicit.pm +++ b/lib/Graph/Implicit.pm @@ -15,8 +15,8 @@ Graph::Implicit - graph algorithms for implicitly specified graphs map { [$_, $_->intrinsic_cost] } $tile->grep_adjacent(sub { $_[0]->is_walkable }) }); - my @reachable_vertices = $graph->vertices; - my @reachable_edges = $graph->edges; + my @reachable_vertices = $graph->vertices(current_tile()); + my @reachable_edges = $graph->edges(current_tile()); my ($sssp_predecessors, $dest_vertex) = $graph->dijkstra( current_tile(), sub { is_target($_[0]) ? 'q' : 0 }, |