输出有向图的环路（山债版）

public class Node {

 int vex;
 Node next;
 public Node(int i){
  vex = i;
  next = null;
 }
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Circle {

 static Node adjList[];
 static int visited[];
 static int path[];
 static int qufen[];
 static int num;
 
 public static void main(String[] args) throws IOException{
  Circle fas = new Circle();
  BufferedReader br= new BufferedReader(
        new InputStreamReader(System.in));
  System.out.println("请输入结点个数:");
  num = Integer.parseInt(br.readLine());
  adjList =new Node[num];
  for(int i=0;i<num;i++)
   adjList[i] = new Node(0);
  visited = new int[num];
  qufen  = new int [num];
  path = new int[num*2];
  for(int i&#