Skip to content

Commit ce7ac75

Browse files
chen0040chen0040
committed
kruskal example
1 parent e0f92a0 commit ce7ac75

File tree

4 files changed

+126
-11
lines changed

4 files changed

+126
-11
lines changed

‎README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -273,7 +273,7 @@ for (var v = 0; v < graph.V; ++v) {
273273

274274
### Use Kruskal algorithm to find the minimum spanning tree of a weighted graph
275275

276-
The sample code below show how to obtain the minimum spanning tree from a weighted graph using Kruskal algorithm:
276+
The sample code below show how to obtain the minimum spanning tree from a weighted graph using Kruskal algorithm (Link: [HTML DEMO](https://rawgit.com/chen0040/js-graph-algorithms/master/examples/example-kruskal.html)):
277277

278278
```javascript
279279
var jsgraphs = require('js-graph-algorithms');

‎examples/example-kruskal.html‎

Lines changed: 103 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,103 @@
1+
<html>
2+
<head>
3+
<title>
4+
Minimum Spanning Tree Weighted Graph (Kruskal)
5+
</title>
6+
<script src="../third-party-libs/vis/vis.js" type="text/javascript"></script>
7+
<script src="../src/jsgraphs.js" type="text/javascript"></script>
8+
<link href="../third-party-libs/vis/vis.css" type="text/css" />
9+
</head>
10+
11+
<body>
12+
<h2>Minimum Spanning Tree Weighted Graph (Kruskal)</h2>
13+
<div id="mynetwork"></div>
14+
15+
<script type="text/javascript">
16+
(function(){
17+
var g = new jsgraphs.WeightedGraph(8);
18+
19+
g.addEdge(new jsgraphs.Edge(0, 7, 0.16));
20+
g.addEdge(new jsgraphs.Edge(2, 3, 0.17));
21+
g.addEdge(new jsgraphs.Edge(1, 7, 0.19));
22+
g.addEdge(new jsgraphs.Edge(0, 2, 0.26));
23+
g.addEdge(new jsgraphs.Edge(5, 7, 0.28));
24+
g.addEdge(new jsgraphs.Edge(1, 3, 0.29));
25+
g.addEdge(new jsgraphs.Edge(1, 5, 0.32));
26+
g.addEdge(new jsgraphs.Edge(2, 7, 0.34));
27+
g.addEdge(new jsgraphs.Edge(4, 5, 0.35));
28+
g.addEdge(new jsgraphs.Edge(1, 2, 0.36));
29+
g.addEdge(new jsgraphs.Edge(4, 7, 0.37));
30+
g.addEdge(new jsgraphs.Edge(0, 4, 0.38));
31+
g.addEdge(new jsgraphs.Edge(6, 2, 0.4));
32+
g.addEdge(new jsgraphs.Edge(3, 6, 0.52));
33+
g.addEdge(new jsgraphs.Edge(6, 0, 0.58));
34+
g.addEdge(new jsgraphs.Edge(6, 4, 0.93));
35+
36+
var kruskal = new jsgraphs.KruskalMST(g);
37+
var mst = kruskal.mst;
38+
39+
40+
var g_nodes = [];
41+
var g_edges = [];
42+
for(var v=0; v < g.V; ++v){
43+
g.node(v).label = 'Node ' + v; // assigned 'Node {v}' as label for node v
44+
g_nodes.push({
45+
id: v,
46+
label: g.node(v).label
47+
});
48+
}
49+
50+
for(var i=0; i < mst.length; ++i) {
51+
var e = mst[i];
52+
var v = e.either();
53+
var w = e.other(v);
54+
e.highlighted = true;
55+
console.log('(' + v + ', ' + w + '): ' + e.weight);
56+
g_edges.push({
57+
from: v,
58+
to: w,
59+
length: e.weight,
60+
label: '' + e.weight,
61+
color: '#ff0000',
62+
value: 2
63+
});
64+
}
65+
66+
for(var v = 0; v < g.V; ++v) {
67+
68+
var adj_v = g.adj(v);
69+
for(var i = 0; i < adj_v.length; ++i) {
70+
var e = adj_v[i];
71+
var w = e.other(v);
72+
if(w > v) continue; // make sure only one edge between w and v since the graph is undirected
73+
if(e.highlighted) continue;
74+
75+
g_edges.push({
76+
from: v,
77+
to: w,
78+
length: e.weight,
79+
label: '' + e.weight
80+
});
81+
};
82+
}
83+
84+
console.log(g.V); // display 6, which is the number of vertices in g
85+
console.log(g.adj(0)); // display [5, 1, 2], which is the adjacent list to vertex 0
86+
87+
var nodes = new vis.DataSet(g_nodes);
88+
89+
// create an array with edges
90+
var edges = new vis.DataSet(g_edges);
91+
92+
// create a network
93+
var container = document.getElementById('mynetwork');
94+
var data = {
95+
nodes: nodes,
96+
edges: edges
97+
};
98+
var options = {};
99+
var network = new vis.Network(container, data, options);
100+
})();
101+
</script>
102+
</body>
103+
</html>

‎examples/example-topo-sort.html‎

Lines changed: 21 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -33,36 +33,47 @@ <h2>Topological Sort on Directed Acyclic Graph</h2>
3333
var order = ts.order();
3434
console.log(order); // display array which is the topological sort order
3535

36+
37+
3638
var g_nodes = [];
3739
var g_edges = [];
40+
41+
42+
3843
for(var v=0; v < g.V; ++v){
3944
g.node(v).label = 'Node ' + v; // assigned 'Node {v}' as label for node v
4045
g_nodes.push({
4146
id: v,
4247
label: g.node(v).label
4348
});
44-
45-
var adj_v = g.adj(v);
46-
for(var i = 0; i < adj_v.length; ++i) {
47-
var w = adj_v[i];
48-
g_edges.push({
49-
from: v,
50-
to: w,
51-
arrows:'to'
52-
});
53-
};
5449
}
5550

5651
for(var i = 1; i < order.length; ++i) {
5752
var x1 = order[i-1];
5853
var x2 = order[i];
54+
if(g.edge(x1, x2) != null) g.edge(x1, x2).highlighted = true;
5955
g_edges.push({
6056
from: x1,
6157
to: x2,
6258
color: '#ff0000',
6359
arrows: 'to'
6460
})
6561
}
62+
63+
for(var v= 0; v < g.V; ++v) {
64+
var adj_v = g.adj(v);
65+
for(var i = 0; i < adj_v.length; ++i) {
66+
var w = adj_v[i];
67+
if(g.edge(v, w).highlighted) continue;
68+
g_edges.push({
69+
from: v,
70+
to: w,
71+
arrows:'to'
72+
});
73+
};
74+
}
75+
76+
6677

6778
console.log(g.V); // display 6, which is the number of vertices in g
6879
console.log(g.adj(0)); // display [5, 1, 2], which is the adjacent list to vertex 0

‎test/graph-spec.js‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -13,6 +13,7 @@ describe("Create various types of Graphs", function() {
1313
g.addEdge(3, 5);
1414
g.addEdge(0, 2);
1515
g.node(2).label = 'Hello';
16+
g.edge(0, 2).label = 'World';
1617
it("should has 6 vertices", function() {
1718
expect(g.V).to.equal(6);
1819
});

0 commit comments

Comments
 (0)