有向图邻接表表示及反向图构造（第五周作业）

     作业基本是按时完成了，但由于某些原因并不能及时上传到博客空间上，所以时间上有些延后，时间一到，也趁着有空时间上传上来，这次实验还是有很多值得思考的，确实有些地方搞不懂，而且也尝试试用曾经没用过的方法来写，如StringTokenizer的使用等，希望接下来的作业都能加入自己未接触过的知识。本次作业代码如下：

package graph;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class GraphReverse {
	static int vertexNum;
	static int arcNum;

	public static void main(String[] args) {      //主方法，实现功能的呈现
		getSorted(getData(), 0);
		getSorted(getData(), 1);
	}

	private static int[][] getData() {
		int[][] matrix = null;
		try {
			File file = new File("src/tinyDG.txt");
			InputStreamReader reader = new InputStreamReader(
					new FileInputStream(file));
			BufferedReader bufferedreader = new BufferedReader(reader);
			int index = 1;
			String str = "";
			while ((str = bufferedreader.readLine()) != null) {
				if (index == 1) { // 读取第一行数字，并作为顶点数附值给vertexNum
					vertexNum = Integer.parseInt(str.trim());
					index++;
					System.out.print("获取图的顶点数为：" + vertexNum + "\n");
					continue;
				} else if (index == 2) { // 获取第二行数字，并作为边数赋值给arcNum
					arcNum = Integer.parseInt(str.trim());
					index++;
					System.out.print("获取图的边的个数为：" + arcNum + "\n");
					continue;

				}

			}
			String temp = "";
			int count = 0;
			while((temp = bufferedreader.readLine()) != null) {
				int point = 0;
				StringTokenizer st = new StringTokenizer(temp);
				
				while (st.hasMoreElements()) {
					matrix[count][point] = Integer.valueOf(st.nextToken());
					point++;
				}
				
				count++;
			}

		} catch (Exception e) {
			e.printStackTrace();
		}
		return matrix;
	}
	private static void getSorted(int[][] data, int function) {       //通过此方法实现有序表和反向图的区别
		String s = "";
		int begin=0, end=0;
		
		if (function == 0) {
			s = "有序表的邻接表如下：";
			begin = 0;
			end = 1;
		} else if (function == 1) {
			s = "反向图的邻接表如下：";
			begin = 1;
			end = 0;
		}
		
		System.out.println(s);
		
		for (int i=0; i< vertexNum; i++) {
			System.out.print(i + ": ");
			for (int j=0; j<data.length; j++) {
				if (data[j][begin] == i) {
					System.out.print("\t" + data[j][end]);
				}
			}
			System.out.println("");
		}
	}
	

}