aga,agar: Rename aga_dijkstra_all_paths()
authorDavid Gibson <david@gibson.dropbear.id.au>
Sat, 11 Jun 2016 03:10:58 +0000 (13:10 +1000)
committerDavid Gibson <david@gibson.dropbear.id.au>
Fri, 4 Nov 2016 12:38:47 +0000 (23:38 +1100)
commitfd96a212810bff1574b047c9079e3e050feb8a28
tree7517755c7a3ee0bf97b2d51fcd8863b21208a46a
parentf8361f19e6860791463b1d10415987a67088e4e5
aga,agar: Rename aga_dijkstra_all_paths()

aga_dijkstra_all_paths() runs Dijkstra's algorithm to completion (as
opposed to aga_dijkstra_path(), which operates lazily).  In effect this
computes the shortest path to all (reachable) nodes from the start node.

So, in this context the name makes sense.  But for an analogous function
for future algorithms (e.g. Bellman-Ford), the name doesn't make sense.

So, in the interests of consistency with those future extensions, change
the name of this to aga_dijkstra_complete().

Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
ccan/aga/aga.h
ccan/aga/dijkstra.c
ccan/aga/test/api-dijkstra.c
ccan/agar/agar.c
ccan/agar/agar.h
ccan/agar/test/api-dijkstra.c