作業基本是按時完成了,但由於某些原因並不能及時上傳到博客空間上,所以時間上有些延後,時間一到,也趁着有空時間上傳上來,這次實驗還是有很多值得思考的,確實有些地方搞不懂,而且也嘗試試用曾經沒用過的方法來寫,如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("");
}
}
}