Prim’s Minimum Spanning Tree (MST)
This algorithm to create MST using Prim’s algorithm
See graph related utility and classes here
Algorithm
In Below algorithm we are taking Edge weight using sum of two NodeIds like as per below.
e.setWeight(this.getNodeId() + node.getNodeId());
|
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 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 |
package com.omt.learn.geekforgeek.greedy; import java.util.HashSet; import java.util.PriorityQueue; import java.util.Set; import com.omt.learn.algo.util.graph.Edge; import com.omt.learn.algo.util.graph.Graph; import com.omt.learn.algo.util.graph.Node; import com.omt.learn.algo.util.graph.State; /** * Prim’s Minimum Spanning Tree * * NOTE: Prim's algorithm will consider Graph as a directed graph by checking is * visited status of node. If both node of EDGE is visited already then do not * include it in selected EDGE * * Algorithm will start with first vertex of graph. * * @author janudhiral * */ public class MSP_PRIMS { public static void main(String... args) { for (Edge e : getSelectedMSPEdges(generateLoopGraph())) { System.out.println(e.getTo().getVertex() + "---" + e.getFrom().getVertex() + ":" + e.getWeight()); } } private static Set<Edge> getSelectedMSPEdges(Graph g) { Set<Edge> selectedEdges = new HashSet<>(); int totalEdgesInMSP = g.getVertices().size() - 1; PriorityQueue<Edge> smallestEdgeFirst = new PriorityQueue<>(); smallestEdgeFirst.addAll(g.getVertices().get(0).getEdges()); g.getVertices().get(0).setState(State.VISITED); while (!smallestEdgeFirst.isEmpty() && selectedEdges.size() < totalEdgesInMSP) { Edge edge = smallestEdgeFirst.poll(); // !selectedEdges.contains(edge) : This one to avoid duplicate edge processing. // It is not required but will helpful to understand this algorithm properly if (!selectedEdges.contains(edge) && (edge.getTo().isUnvisited() || edge.getFrom().isUnvisited())) { selectedEdges.add(edge); // Get all the edges from unvisited nodes if (edge.getTo().isUnvisited()) { smallestEdgeFirst.addAll(edge.getTo().getEdges()); } if (edge.getFrom().isUnvisited()) { smallestEdgeFirst.addAll(edge.getFrom().getEdges()); } // Mark both nodes as visited, This is to avoid loop by making entire graph as // directed edge.getTo().setState(State.VISITED); edge.getFrom().setState(State.VISITED); } } return selectedEdges; } public static Graph generateLoopGraph() { Graph graph = new Graph(); Node a = new Node("A"); // 0 a.setNodeId(9); Node b = new Node("B"); // 1 b.setNodeId(1); Node c = new Node("C"); // 2 c.setNodeId(3); Node d = new Node("D"); // 3 d.setNodeId(4); Node e = new Node("E"); // 4 e.setNodeId(5); Node f = new Node("F"); // 5 f.setNodeId(2); Node g = new Node("G"); // 6 g.setNodeId(7); Node h = new Node("H"); // 7 h.setNodeId(6); a.addAdjacent(b); a.addAdjacent(c); b.addAdjacent(d); b.addAdjacent(a); d.addAdjacent(b); d.addAdjacent(e); d.addAdjacent(f); e.addAdjacent(d); e.addAdjacent(f); e.addAdjacent(g); f.addAdjacent(e); f.addAdjacent(d); f.addAdjacent(g); g.addAdjacent(e); g.addAdjacent(f); c.addAdjacent(a); c.addAdjacent(h); h.addAdjacent(c); graph.addVertex(a); graph.addVertex(b); graph.addVertex(c); graph.addVertex(d); graph.addVertex(e); graph.addVertex(f); graph.addVertex(g); graph.addVertex(h); return graph; } } |
Output :
|
1 2 3 4 5 6 7 |
H---C:9 C---A:12 E---F:7 F---D:6 D---B:5 G---F:9 B---A:10 |
