stub out some algorithms to implement

1 files changed, 49 insertions, 0 deletions

diff --git a/lib/Graph/Implicit.pm b/lib/Graph/Implicit.pm
index 2fc12ab..585dd6f 100644
--- a/lib/Graph/Implicit.pm
+++ b/lib/Graph/Implicit.pm
@@ -19,6 +19,41 @@ sub new {
     return bless $edge_calculator, $class;
 }
 
+# generic information
+
+sub vertices {
+}
+
+sub edges {
+}
+
+sub neighbors {
+}
+
+# traversal
+
+sub bfs {
+}
+
+sub dfs {
+}
+
+sub iddfs {
+}
+
+# minimum spanning tree
+
+sub boruvka {
+}
+
+sub prim {
+}
+
+sub kruskal {
+}
+
+# single source shortest path
+
 sub dijkstra {
     my $self = shift;
     my $from = shift;
@@ -54,4 +89,18 @@ sub dijkstra {
     return \%pred, $max_vert;
 }
 
+sub astar {
+}
+
+sub bellman_ford {
+}
+
+# all pairs shortest path
+
+sub johnson {
+}
+
+sub floyd_warshall {
+}
+
 1;