Professional Documents
Culture Documents
package first_project;
import java.util.*;
}
}
int p,i,j,temp;
p=arr[low];
i=low+1;
j=high;
while(low<high)
{
while(arr[i]<=p && i<high)
i++;
while(arr[j]>p)
j--;
if(i<j)
{
temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
else
{
temp=arr[low];
arr[low]=arr[j];
arr[j]=temp;
return j;
}
}
return j;
}
//Flyoids ALgorithm
package first_project;
import java.util.Scanner;
System.out.println();
}
sc.close();
}}
//BFS traversal
package second_project;
import java.util.LinkedList;
//import java.util.*;
import java.util.Queue;
import java.util.Scanner;
int v = scan.nextInt();
adj[i][j] = scan.nextInt();
int s = scan.nextInt();
vis[s] = true;
queue.add(s);
while (!queue.isEmpty()) {
int cv = queue.poll();
vis[i] = true;
queue.add(i);
}
}
}
//DFS
package second_project;
import java.util.*;
//PRIMS
package first_project;
import java.util.Scanner;
while (k <= n - 1) {
min = Integer.MAX_VALUE;
if (min == Integer.MAX_VALUE) {
System.out.println("No spanning
tree");
return; // Exit the program
}
sol[v] = 1;
sum = sum + min;
k++;
System.out.println(u + "->" + v + "=" +
min);
}
if (flag)
System.out.println("No spanning tree");
else
System.out.println("The cost of minimum
spanning tree is " + sum);
sc.close();
}
}
//Krushkals
package first_project;
import java.util.Scanner;
int find(int m) {
int p = m;
while (parent[p] != 0)
p = parent[p];
return p;
}
min = 99;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (a[i][j] < min && i != j) {
min = a[i][j];
u = i;
v = j;
}
i = find(u);
j = find(v);
if (i != j) {
union(i, j);
System.out.println("(" + u + "," + v
+ ")" + "=" + a[u][v]);
sum = sum + a[u][v];
k++;
}
a[u][v] = a[v][u] = 99;
}
System.out.println("The cost of minimum
spanning tree = " + sum);
}