X-Git-Url: http://git.ozlabs.org/?a=blobdiff_plain;f=ccan%2Faga%2Fdijkstra.c;h=cbb79b90779596c6f7c56e0cae18ebee107aeb7b;hb=55d814230f7fb628bb5303cd53498209c7928040;hp=97b485fbb4809448711f295565c93f3c5dcccf54;hpb=1e742b68d026a258ccf99338f05daf8b694978a3;p=ccan

diff --git a/ccan/aga/dijkstra.c b/ccan/aga/dijkstra.c
index 97b485fb..cbb79b90 100644
--- a/ccan/aga/dijkstra.c
+++ b/ccan/aga/dijkstra.c
@@ -17,12 +17,6 @@
  * Dijkstra's algorithm
  */
 
-/* Node states */
-#define STATE_INFINITE	0
-#define STATE_FINITE	1
-#define STATE_COMPLETE	2
-
-
 static void candidate_path(struct aga_graph *g, struct aga_node *node,
 			   aga_icost_t distance,
 			   struct aga_node *prev, const void *prevedge)
@@ -120,7 +114,7 @@ bool aga_dijkstra_path(struct aga_graph *g, struct aga_node *node,
 	return true;
 }
 
-void aga_dijkstra_all_paths(struct aga_graph *g)
+void aga_dijkstra_complete(struct aga_graph *g)
 {
 	if (!aga_check_state(g))
 		return;