ONLINE SUMMER TRAINING Online Courses Free Tutorials 
 Placement Preparation 
Artificial Intelligence(AI) & Machine Learning(ML) Training in Jaipur
0 like 0 dislike
149 views

Goeduhub's Online Courses @Udemy

For Indian Students- INR 570/- || For International Students- $12.99/-

S.No.

Course Name

Apply Coupon

1.

Tensorflow 2 & Keras:Deep Learning & Artificial Intelligence

Apply Coupon

2.

Computer Vision with OpenCV | Deep Learning CNN Projects

Apply Coupon

3.

Complete Machine Learning & Data Science with Python Apply Coupon

4.

Natural Language Processing-NLP with Deep Learning in Python Apply Coupon

5.

Computer Vision OpenCV Python | YOLO| Deep Learning in Colab Apply Coupon

6.

Complete Python Programming from scratch with Projects Apply Coupon

1 Answer

0 like 0 dislike
by Goeduhub's Expert (5.8k points)
 
Best answer

For Theory of Prim's Algorithm Click here

Java Program

import java.util.*; 

import java.lang.*; 

import java.io.*; 

class Prims { 

// Number of vertices in the graph 

private static final int V = 5; 

// function to find the vertex with minimum key 

int minKey(int key[], Boolean mstSet[]) 

// Initialize min value 

int min = Integer.MAX_VALUE, min_index = -1; 

for (int v = 0; v < V; v++) 

if (mstSet[v] == false && key[v] < min) { 

min = key[v]; 

min_index = v; 

return min_index; 

void printMST(int parent[], int graph[][]) 

System.out.println("Edge \tWeight"); 

for (int i = 1; i < V; i++) 

System.out.println(parent[i] + " - " + i + "\t" + graph[i][parent[i]]); 

    void primMST(int graph[][]) 

// Array to store constructed MST 

int parent[] = new int[V]; 

// Key values used to pick minimum weight edge in cut 

int key[] = new int[V]; 

// To represent set of vertices not yet included in MST 

Boolean mstSet[] = new Boolean[V]; 

// Initialize all keys as INFINITE 

for (int i = 0; i < V; i++) { 

key[i] = Integer.MAX_VALUE; 

mstSet[i] = false; 

// Always include first 1st vertex in MST. 

key[0] = 0; // Make key 0 so that this vertex is 

// picked as first vertex 

parent[0] = -1; // First node is always root of MST 

// The MST will have V vertices 

for (int count = 0; count < V - 1; count++) { 

// Pick thd minimum key vertex from the set of vertices 

// not yet included in MST 

int u = minKey(key, mstSet); 

// Add the picked vertex to the MST Set 

mstSet[u] = true; 

            for (int v = 0; v < V; v++) 

if (graph[u][v] != 0 && mstSet[v] == false && graph[u][v] < key[v]) { 

parent[v] = u; 

key[v] = graph[u][v]; 

        printMST(parent, graph); 

public static void main(String[] args) 

Prims t = new Prims(); 

int graph[][] = new int[][] { { 0, 2, 0, 6, 0 }, 

{ 2, 0, 3, 8, 5 }, 

{ 0, 3, 0, 0, 7 }, 

{ 6, 8, 0, 0, 9 }, 

{ 0, 5, 7, 9, 0 } }; 

    t.primMST(graph); 

}

Output

Output


For more VTU IV Sem DAA Lab Experiments Click here


Our Mentors(For AI-ML)


Sharda Godara Chaudhary

Mrs. Sharda Godara Chaudhary

An alumna of MNIT-Jaipur and ACCENTURE, Pune

NISHA (IIT BHU)

Ms. Nisha

An alumna of IIT-BHU

Related questions

 Goeduhub:

About Us | Contact Us || Terms & Conditions | Privacy Policy || Youtube Channel || Telegram Channel © goeduhub.com Social::   |  | 
...