CCF之交通规则（java）

解题代码（java）：

方法一：

import java.util.HashSet;
import java.util.Scanner;  
  
  
public class Main {  
    public static void main(String[] args)  
    {  
        new Main().run();  
  
    }  
    public void run ()  
    {  
        HashSet<Integer> close=new HashSet<Integer>();  
        HashSet<Integer> open=new HashSet<Integer>();  
        close.add(0);  
        Scanner s=new Scanner(System.in);  
        int citynum=s.nextInt();  
        int roadnum=s.nextInt();  
        for (int i = 1; i <citynum ; i++) {  
            open.add(i);  
        }  
        
        int[][] djs=new int[citynum][citynum];  
        for (int i = 0; i < citynum; i++) {  
            for (int j = 0; j < citynum; j++) {  
                if(i==j)  
                    {djs[i][j]=0;}  
                else  
                    djs[i][j]=10000;  
            }  
        }  
        int[][] minroad=new int[citynum][2];  
        for (int i = 0; i <roadnum ; i++) {  
            int a=s.nextInt();  
            int b=s.nextInt();  
            int c=s.nextInt();  
            djs[a-1][b-1]=djs[b-1][a-1]=c;  
        }  
        while(!open.isEmpty())  
        {  
            int roadlong = 100000000;  
            int targetcity = 0;  
            int passcity=0;  
            for (int start:close)  
            {  
                for (int target:open) {  
                      
                    if(djs[start][target]+djs[0][start]<roadlong||((djs[start][target]+djs[0][start]==roadlong)&&(djs[start][target]<djs[passcity][targetcity])))  
                    {  
                        passcity=start;  
                        targetcity=target;  
                        roadlong=djs[start][target]+djs[0][start];  
                    }  
                }  
            }  
            open.remove(targetcity);  
            close.add(targetcity);  
            minroad[targetcity][0]=passcity;  
            minroad[targetcity][1]=roadlong;  
              
              
  
        }  
        int min=0;  
        for (int i = 1; i <citynum; i++) {  
            min+=djs[minroad[i][0]][i];  
        }  
        System.out.println(min);  
    }  
} 

方法二：

import java.util.Scanner;
import java.util.Vector;
import java.lang.Math;
public class HighSpeed {		
	
	@SuppressWarnings("unchecked")	
	public static Vector<Integer> []g = new Vector[10005];	
	@SuppressWarnings("unchecked")	
	public static Vector<Integer> component[] = new Vector[10005];			
	public static int []STACK = new int[10005];	
	static int TOP=0;        
	static boolean [] instack = new boolean[10005];    
	static int []dfn = new int[10005];    	
	static int []low = new int[10005];    	
	static int index=1;    	
	static int cnt=0; 	
	public static void main(String[] args)	{		
		int n =0,m=0,x=0,y=0;    	    
		int ans=0;  	    
		Scanner in = new Scanner(System.in);	   
		n = in.nextInt();	    
		m = in.nextInt();	    	      
		for(int i = 0;i<n+1;i++){	    	
			g[i] = new Vector<Integer>();	    		   
		}	    
		for(int i = 0;i<5000;i++){	    	
			component[i] = new Vector<Integer>();
		}	    
		for(int i = 0;i<m;i++) {	    	
			x= in.nextInt();	    	
			y=in.nextInt();	    	
			g[x].add(y);	    
		}	    
		in.close();	    
		for(int i=1;i<=n;i++){    	        
			if(dfn[i]==0)	        	
				tarjan(i);    	    
		}  	    	    
		for(int i=1;i<=cnt;i++){    	       
			Vector<Integer> vec=component[i];    	       
			int sz=vec.size();    	       	        
			if(sz==1)	        	
				continue;    	        
			else	        	
				ans+=sz*(sz-1)/2;    	   
		}    	    
		System.out.println(ans);	    	     	
	}		
	static void tarjan(int x){    	    
		dfn[x]=low[x]=index++;    	    
		instack[x]=true;    	    
		STACK[++TOP]=x;    	    
		int j; 	    	    
		for(int i=0;i<g[x].size();i++){     
			 	        
			j=g[x].get(i);    	        
			if(dfn[j]==0){    	            
				tarjan(j);    	            
				low[x]=Math.min(low[x],low[j]);    	        
			}else if(instack[j]){    	           
				low[x]=Math.min(low[x],dfn[j]);    	       
			}    	   
		}    	    
		if(dfn[x]==low[x]){    	            
			cnt++;    	            
			do{    	                
				j=STACK[TOP--];    	                
				instack[j]=false;    	                
				component[cnt].add(j);   	            
			}while(x!=j);    	   
			    	
		}    			
	}
		
	
}

结果为0，为啥？为啥？