计算一个有向图所有的简单圈（除起点和终点外没有重复顶点的圈）

要求：先设计算法（可查文献），然后用程序实现。程序允许输入一个无向图，或从文件读入一个图，然后求出图的所有简单圈。

*******************************************************************************

package test;
import java.util.ArrayList;
import java.util.Arrays;
public class TestCycle {
     private int n;
     private int[] visited;//节点状态,值为0的是未访问的
     private int[][] e;//有向图的邻接矩阵
     private ArrayList<Integer> trace=new ArrayList<Integer>();//从出发节点到当前节点的轨迹
     private boolean hasCycle=false;

     public TestCycle(int n,int[][] e){
         this.n=n;
         visited=new int[n];
         Arrays.fill(visited,0);
         this.e=e;
     }
    
     void findCycle(int v)   //递归DFS
    {
        if(visited[v]==1)
        {
            int j;
            if((j=trace.indexOf(v))!=-1)
            {
                hasCycle=true;
                System.out.print("Cycle:");
                while(j<trace.size())
                {
                    System.out.print(trace.get(j)+" ");
                    j++;
                }
                System.out.print("\n");
                return;
            }
        }
        visited[v]=1;
        trace.add(v);
        
        for(int i=0;i<n;i++)
        {
            if(e[v][i]==1){
            	findCycle(i);
            }
        }
        trace.remove(trace.size()-1);
    }
  
  public boolean getHasCycle(){
      return hasCycle;
  }

   public static void main(String[] args) {
        int n=7;
        int[][] e={
                    {0,1,0,0,0,0,0},
                    {0,0,1,0,1,0,1},
                    {1,0,0,1,0,0,0},
                    {0,1,0,0,0,0,0},
                    {0,0,0,1,0,1,1},
                    {0,0,0,1,0,0,0},
                    {1,0,0,0,0,0,0}};//有向图的邻接矩阵
        TestCycle tc=new TestCycle(n,e);
        tc.findCycle(2);
        if(!tc.hasCycle) 
            System.out.println("No Cycle.");
    }
}