This is a Java implementation of Prims Algorithm for finding the minimum spanning tree. You need to specify the graph using a .txt file. Taking an example of a very basic graph . For example , you ...

Data structure and Algorithms, Java workouts ,Problem Solving questions and solutions.(Repository contains major Graph alogirthms like Bellmanford algo,Prim's ,Dijkstra's algorithm).