diff options
author | Jesse Luehrs <doy@tozt.net> | 2009-06-21 17:04:38 -0500 |
---|---|---|
committer | Jesse Luehrs <doy@tozt.net> | 2009-06-21 17:04:38 -0500 |
commit | 9a1426d70f3c094b1148560c047e6369e6c9cf7f (patch) | |
tree | acb2660d0e60a1b69e0b4f7566de973946930ea8 | |
parent | fa7ff8c5e7e9ea86a7e44353a1519616afeb3ef8 (diff) | |
download | graph-implicit-9a1426d70f3c094b1148560c047e6369e6c9cf7f.tar.gz graph-implicit-9a1426d70f3c094b1148560c047e6369e6c9cf7f.zip |
add some TODO items
-rw-r--r-- | lib/Graph/Implicit.pm | 12 |
1 files changed, 12 insertions, 0 deletions
diff --git a/lib/Graph/Implicit.pm b/lib/Graph/Implicit.pm index bab96f3..c74c70f 100644 --- a/lib/Graph/Implicit.pm +++ b/lib/Graph/Implicit.pm @@ -312,6 +312,18 @@ Please report any bugs through RT: email C<bug-graph-implicit at rt.cpan.org>, or browse to L<http://rt.cpan.org/NoAuth/ReportBug.html?Queue=Graph-Implicit>. +=head1 TODO + +=over + +=item dijkstra/astar and bfs/dfs should have more similar interfaces - right now bfs/dfs just call a coderef and do nothing with it, while dijkstra/astar use the coderef to search for a vertex + +=item Several more graph algorithms need implementations + +=item Returning two values from dijkstra and astar is kind of ugly, need to make this better + +=back + =head1 SEE ALSO L<Moose> |