aga,agar: Negative weight cycle testcase
Adds a new test graph which includes a negative weight cycle. This means
that shortest paths are not well defined, and both Dijkstra's algorithm and
the Bellman-Ford algorithm (which can handle some negative edge weights)
will fail.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
Showing
ccan/aga/test/negacycle.c
0 → 100644
ccan/agar/test/negacycle.c
0 → 100644
Please register or sign in to comment