用Java编辑实现warshall算法_Java Floyd-Warshall算法实现

import java.util.Scanner;

public class FloydWarshall

{

private int DistanceMatrix[][];

private int numberofvertices;//number of vertices in the graph

public static final int INFINITY = 999;

public FloydWarshall(int numberofvertices)

{

DistanceMatrix = new int[numberofvertices + 1][numberofvertices + 1];//stores the value of distance from all the possible path form the source vertex to destination vertex

Arrays.fill(DistanceMatrix, 0);

this.numberofvertices = numberofvertices;

}

public void floydwarshall(int AdjacencyMatrix[][])//calculates all the distances from source to destination vertex

{

for (int source = 1; source <= numberofvertices; source++)

{

for (int destination = 1; destination <= numberofvertices; destination+