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

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81

package aLgraph;
import java.io.BufferedReader;import java.io.File;import java.io.FileReader;
public class GraphReverse {
public static void main(String[] args) {		// TODO 自动生成的方法存根				File file = new File("F:/Arithmetic/tinyDG.txt");		int V;		int E;		int v[];		int g[][];		int h[][];		int tempchar;		String str = "";				try {			FileReader in = new FileReader(file);			BufferedReader bufr = new BufferedReader(in);			str = bufr.readLine();			V = Integer.parseInt(str);			v = new int[V];			for(int i = 0; i < V; i++){  				v[i]=i;  	        }  			str = bufr.readLine();			E = Integer.parseInt(str);			g = new int[V][V];			h = new int[V][V];			str = "";			int a = 0;			int b = 0;			while ((tempchar = bufr.read()) != -1) {				str = str + (char) tempchar;				if ((char) tempchar == ' ') {					a = Integer.parseInt(str.trim());					str = "";				}				if ((char) tempchar == '\n') {					b = Integer.parseInt(str.trim());					g[a] = 1;					h[b][a] = 1;					str = "";				}			}			System.out.println("有向图邻接表：");			for (int i = 0; i < V; i++) {				System.out.print(v[i]+":");				for (int j = 0; j < V; j++) {					if (g[i][j] !=0) {						System.out.print(j+" ");					}				}				System.out.println("");			}			System.out.println("");			System.out.println("反向图邻接表：");			for (int i = 0; i < V; i++) {				System.out.print(v[i]+":");				for (int j = 0; j < V; j++) {					if (h[i][j] !=0) {						System.out.print(j+" ");					}				}				System.out.println("");			}			bufr.close();			in.close();		}				catch(Exception e) {			e.printStackTrace();		}			}
}