From 9a1426d70f3c094b1148560c047e6369e6c9cf7f Mon Sep 17 00:00:00 2001
From: Jesse Luehrs <doy@tozt.net>
Date: Sun, 21 Jun 2009 17:04:38 -0500
Subject: add some TODO items

---
 lib/Graph/Implicit.pm | 12 ++++++++++++
 1 file changed, 12 insertions(+)

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>
-- 
cgit v1.2.3