These were left over from a previous approach which didn't pan out.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
* Dijkstra's algorithm
*/
* 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)
static void candidate_path(struct aga_graph *g, struct aga_node *node,
aga_icost_t distance,
struct aga_node *prev, const void *prevedge)