AllPair.

java
import java.util.*;
class Graph
{
int g[][];
int v,e;
int visited[],x[],n;
void creategraph()
{
int a,b,w;
Scanner kbd=new Scanner(System.in);
System.out.print("Enter No. Of Vertices");
v=kbd.nextInt();
System.out.print("Enter No. Of Edges");
e=kbd.nextInt();
//create matrix of v+1 rows & v+1 cols
g=new int[v+1][v+1];
//initialize entire matrix g to zero
for (int i=1;i<=v;i++)
for (int j=1;j<=v;j++)
g[i][j]=0;
//store edge information
for (int i=1;i<=e;i++)
{
System.out.println("Enter Edge Information");
a=kbd.nextInt();
b=kbd.nextInt();
System.out.println("Enter Weight Of This Edge");
w=kbd.nextInt();
g[a][b]=g[b][a]=w;
}
}//end creategraph
void allpair()
{
for(int k=1;k<=v;k++)
for(int i=1;i<=v;i++)
for(int j=1;j<=v;j++)
g[i][j]=Math.min(g[i][j],g[i][k]+g[k][j]);
//print solution in tabular format
System.out.println("Shortest Distance");
System.out.println("From \t\t To");
for(int i=1;i<=v;i++)
for(int j=1;j<=v;j++)
System.out.println(i+"\t\t\t\t"+j+"="+g[i][j]);
}
}//end Graph class
public class AllPair
{
public static void main(String args[])
{
Graph g=new Graph();
g.creategraph();
g.allpair();
}
}

Page 1