-
Notifications
You must be signed in to change notification settings - Fork 9
Expand file tree
/
Copy pathkruskal.js
More file actions
92 lines (69 loc) · 2.23 KB
/
kruskal.js
File metadata and controls
92 lines (69 loc) · 2.23 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
const GraphBase = require('./graph-base');
const DSU = require('./ds/dsu');
class Kruskal extends GraphBase {
constructor(numVertices = 0, numEdges = 0, edges) {
super(numVertices, numEdges);
this.edges = edges;
}
sort_edges() {
let edges = this.edges;
for (let i = 0; i < edges.length; i++) {
for (let j = i + 1; j < edges.length; j++) {
if (edges[i][2] > edges[j][2]) {
let temp = edges[i];
edges[i] = edges[j];
edges[j] = temp;
}
}
}
return edges;
}
kruskal() {
let minSpanningTree = { edgeset: [], total_weight: 0 };
let sorted_edges = this.sort_edges();
let vertices = [];
let Adj = this.getSimpleAdj();
Adj.forEach(function (value, key) {
vertices.push(key);
});
let disjoint_set = new DSU(vertices);
for (let i = 0; i < sorted_edges.length; i++) {
let edge = sorted_edges[i];
let node1 = edge[0],
node2 = edge[1];
let current_weight = edge[2];
if (disjoint_set.find(node1) != disjoint_set.find(node2)) {
disjoint_set.union(node1, node2);
minSpanningTree.edgeset.push([node1, node2]);
minSpanningTree.total_weight += current_weight;
}
}
return minSpanningTree;
}
}
/******************************* TEST ************************/
// const input_file = require('./testfiles/mst_test_kruskal_prim.json');
// const fs = require('fs');
// output_data = new Map();
// for (let testcase = 0; testcase < input_file.length; testcase++) {
// let input = input_file[testcase];
// let vertices = input.vertices
// let edges = input.edges
// const g = new Kruskal(input.numVertices, input.numEdges, edges)
// for (let i = 0; i < vertices.length; i++) {
// g.addVertex(vertices[i]);
// }
// for (let i = 0; i < input.numEdges; i++) {
// let edge = input.edges[i];
// g.addEdge(edge[0], edge[1], edge[2]);
// g.addEdge(edge[1], edge[0], edge[2]);
// }
// let mst = g.kruskal()
// console.log(mst)
// // output_data.set('Testcase ' + testcase, mst ) ;
// }
// fs.writeFileSync(
// 'testfiles/output.json',
// JSON.stringify(Array.from(output_data))
// );
module.exports = Kruskal;