public void runFolydShortPath(Graph g)
	{
		Dis =  g.AdjacentMatrix;
		Path =  new int[g.count][g.count];
		
		int i,j,k;
		for(i=0;i<g.count;i++)
		{
			for(j=0;j<g.count;j++)
			{
				
				if(Dis[i][j]==0) 
				{
					Dis[i][j] = FolydShortPath.max;
					Path[i][j] = -1;
				}
				else{
					Path[i][j] = i;
				}
			}
		}
		
		for(k=0;k<g.count;k++)
		{
			for(i=0;i<g.count;i++)
			{
				for(j=0;j<g.count;j++)
				{
					if(i==j) continue;
					 
					 if(Dis[i][j] >  Dis[i][k]+Dis[k][j])
					{
						Dis[i][j] = Dis[i][k]+Dis[k][j];
						Path[i][j] = Path[k][j];
					}
				}
				
			}
		}
		
	}