第五周作业——有向图强连通分量的编程实现

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.StringTokenizer;

public class GraphReverse {

	private static int vNum;
	private static int eNum;

	public static void main(String[] args) {
		int[][] a = getData();
		for (int i = 0; i < a.length; i++) {
			System.out.print(i + ":");
			for (int j = 0; j < a[i].length; j++) {
				if(a[i][j] == 1)
					System.out.print(j + ".");
			}
			System.out.println();
		}
	}

	private static int[][] getData() {
		int[][] matrix = null;
		
		try {
			BufferedReader reader = new BufferedReader(new FileReader(new File("src/tinyDG.txt")));
			vNum = Integer.valueOf(reader.readLine().trim());
			eNum = Integer.valueOf(reader.readLine().trim());
			matrix = new int[vNum][vNum];
			
			String temp = "";
			while((temp = reader.readLine()) != null) {
				StringTokenizer str = new StringTokenizer(temp);
				
				int[] points = new int[2];
				int index = 0;
				
				while (str.hasMoreElements()) {
					points[index] = Integer.valueOf(str.nextToken());
					index++;
				}
				
				matrix[points[0]][points[1]] =  1;
			}
			
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (NumberFormatException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
		
		return matrix;
	}
}