change a bit of bellman_ford

Author: 64json

algorithm/graph_search/bellman_ford/shortest_path/data.js

@@ -1,3 +1,9 @@
 var tracer = new WeightedDirectedGraphTracer();
-var G = WeightedDirectedGraph.random(5, .5, -5, 5);
+var G = [
+    [0, -1, 4, 0, 0],
+    [0, 0, 3, 2, 2],
+    [0, 0, 0, 0, 0],
+    [0, 1, 5, 0, 0],
+    [0, 0, 0, -3, 0]
+];
 tracer._setData(G);