No self-introduction
Loading
Profile
Follow
codes (1)
The Shortest Circuit of a Non-Oriented Graph
no vote
package Extend_Floyd;
import java.io.*;
import java.util.Scanner;
public class Extend_Floyd {
/**
* @param args
*/
Static final int INF INF=666666666;//attention can overflow, careful!
static final int MAXN=100+10;
static int nnum,mnum,cnt,minn;
static int path[],fa[][],cur[][],dist[][];
static void init()
{
path = new int[MAXN+1];
fa = new int[MAXN+1][MAXN+1];
cur = new int[MAXN+1][MAXN+1];
dist = new int[MAXN+1][MAXN+1];
for(int i=1;i<=MAXN;i++)
for(int j=1;j<=MAXN;j++)
{
if(i==j) dist[i][j]=cur[i][j]=0;
else dist[i][j]=cur[i][j]=INF;
fa[i][j]=-1;
}
minn=INF;
}
Static void findroute (int i,int j)//find the path
{
if(fa[i][j]!=-1) findroute(i,fa[i][j]);
path[cnt++]=j;
}
static void extend_floyd()
{
for(
chenshiming 0 0
1
No more~
Follows0
Fans0