We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent f635cdc commit 3df049bCopy full SHA for 3df049b
algorithm/graph_search/bfs/shortest_path/data.js
@@ -1,12 +1,5 @@
1
var tracer = new WeightedDirectedGraphTracer();
2
var logger = new LogTracer();
3
tracer.attach(logger);
4
-/*var G = [ // G[i][j] indicates the weight of the path from the i-th node to the j-th node
5
- [0, 3, 0, 1, 0],
6
- [5, 0, 1, 2, 4],
7
- [1, 0, 0, 2, 0],
8
- [0, 2, 0, 0, 1],
9
- [0, 1, 3, 0, 0]
10
- ];*/
11
-var G = WeightedDirectedGraph.random(10, .3, 1, 9);
+var G = WeightedDirectedGraph.random(5, 1, 1, 9);
12
tracer._setData(G);
0 commit comments