aga,agar: Negative weight cycle testcase
authorDavid Gibson <david@gibson.dropbear.id.au>
Thu, 3 Nov 2016 10:49:55 +0000 (21:49 +1100)
committerDavid Gibson <david@gibson.dropbear.id.au>
Fri, 4 Nov 2016 12:38:47 +0000 (23:38 +1100)
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>

No differences found