(String[] args)
| 82 | } |
| 83 | |
| 84 | public static void main(String[] args) { |
| 85 | int vertices = 6; // Number of vertices |
| 86 | int edges = 8; // Number of edges |
| 87 | Graph G = new Graph(vertices, edges); |
| 88 | |
| 89 | G.edge[0].src = 0; |
| 90 | G.edge[0].dest = 1; |
| 91 | G.edge[0].weight = 4; |
| 92 | |
| 93 | G.edge[1].src = 0; |
| 94 | G.edge[1].dest = 2; |
| 95 | G.edge[1].weight = 4; |
| 96 | |
| 97 | G.edge[2].src = 1; |
| 98 | G.edge[2].dest = 2; |
| 99 | G.edge[2].weight = 2; |
| 100 | |
| 101 | G.edge[3].src = 2; |
| 102 | G.edge[3].dest = 3; |
| 103 | G.edge[3].weight = 3; |
| 104 | |
| 105 | G.edge[4].src = 2; |
| 106 | G.edge[4].dest = 5; |
| 107 | G.edge[4].weight = 2; |
| 108 | |
| 109 | G.edge[5].src = 2; |
| 110 | G.edge[5].dest = 4; |
| 111 | G.edge[5].weight = 4; |
| 112 | |
| 113 | G.edge[6].src = 3; |
| 114 | G.edge[6].dest = 4; |
| 115 | G.edge[6].weight = 3; |
| 116 | |
| 117 | G.edge[7].src = 5; |
| 118 | G.edge[7].dest = 4; |
| 119 | G.edge[7].weight = 3; |
| 120 | G.KruskalAlgo(); |
| 121 | } |
| 122 | } |
nothing calls this directly
no test coverage detected