Java programs to Implement All-Pairs Shortest Paths problem using Floyd’s algorithm
import java.util.Scanner; public class floyd { void flyd(int[][] w,int n) { int i,j,k; for(k=1;k
q
import java.util.Scanner; public class floyd { void flyd(int[][] w,int n) { int i,j,k; for(k=1;k
import java.util.Scanner; public class prims { public static void main(String[] args) { int w[][]=new int[10][10]; int n,i,j,s,k=0; int min; int sum=0; int u=0,v=0; int flag=0; int sol[]=new int[10]; System.out.println("Enter the…
import java.util.Scanner; public class kruskal { int parent[]=new int[10]; int find(int m) { int p=m; while(parent[p]!=0) p=parent[p]; return p; } void union(int i,int j) { if(i parent[i]=j; else parent[j]=i; }…
import java.util.Scanner; public class Dijkstra { /** * @param args */ int d[]=new int[10]; int p[]=new int[10]; int visited[]=new int[10]; public void dijk(int[][]a, int s, int n) { int u=-1,v,i,j,min;…
import java.util.Scanner; public class knapsacgreedy { /** * @param args */ public static void main(String[] args) { int i,j=0,max_qty,m,n; float sum=0,max; Scanner sc = new Scanner(System.in); int array[][]=new int[2][20]; System.out.println("Enter…
import java.util.Scanner; public class knapsackDP { /** * @param args */ public void solve(int[] wt, int[] val, int W, int N) { int i,j; int[][] sol = new int[N +…
import java.util.Random; import java.util.Scanner; public class mergesort { static int max=10000; void merge( int[] array,int low, int mid,int high) { int i=low; int j=mid+1; int k=low; int[]resarray; resarray=new int[max]; while(i
import java.util.Random; import java.util.Scanner; public class quicksort { static int max=2000; int partition (int[] a, int low,int high) { int p,i,j,temp; p=a[low]; i=low+1; j=high; while(low { while(a[i]p) j--; if(i {…
import java.util.*; class second implements Runnable { public int x; public second (int x) { this.x=x; } public void run() { System.out.println("Second thread:Square of the number is"+x*x); } } class…
import java.util.Scanner; class division { public static void main(String[] args) { int a,b,result; Scanner input =new Scanner(System.in); System.out.println("Input two integers"); a=input.nextInt(); b=input.nextInt(); try { result=a/b; System.out.println("Result="+result); } catch(ArithmeticException e) {…