展开全部
package test;
import java.util.ArrayList;
import java.util.List;
/**
* java-用邻接矩阵求图的最短路径、最长途径。弗洛伊德算法62616964757a686964616fe59b9ee7ad9431333361313939
*/
public class FloydInGraph {
private static int INF=Integer.MAX_VALUE;
private int[][] dist;
private int[][] path;
private List result=new ArrayList();
public FloydInGraph(int size){
this.path=new int[size][size];
this.dist=new int[size][size];
}
public void findPath(int i,int j){
int k=path[i][j];
if(k==-1)return;
findPath(i,k);
result.add(k);
findPath(k,j);
}
public void findCheapestPath(int begin,int end,int[][] matrix){
floyd(matrix);
result.add(begin);
findPath(begin,end);
result.add(end);
}
public void floyd(int[][] matrix){
int size=matrix.length;
for(int i=0;i
for(int j=0;j
path[i][j]=-1;
dist[i][j]=matrix[i][j];
}
}
for(int k=0;k
for(int i=0;i
for(int j=0;j
if(dist[i][k]!=INF&&
dist[k][j]!=INF&&
dist[i][k]+dist[k][j]dist[i][j]-->longestPath
dist[i][j]=dist[i][k]+dist[k][j];
path[i][j]=k;
}
}
}
}
}
public static void main(String[] args) {
FloydInGraph graph=new FloydInGraph(5);
int[][] matrix={
{INF,30,INF,10,50},
{INF,INF,60,INF,INF},
{INF,INF,INF,INF,INF},
{INF,INF,INF,INF,30},
{50,INF,40,INF,INF},
};
int begin=0;
int end=4;
graph.findCheapestPath(begin,end,matrix);
List list=graph.result;
System.out.println(begin+" to "+end+",the cheapest path is:");
System.out.println(list.toString());
System.out.println(graph.dist[begin][end]);
}
}