Java蓝桥杯试题集——算法训练ALGO-48——关联矩阵

题目要求 

解题思路

这题就是要看关联矩阵啦，节点对应行，边对应列。 如果 a 节点是 i 边的出发点，则graph[a -1 ][i] = 1, 如果 b 节点是 i 边的终点，则 graph [b -1] [i] = -1。-1是因为数组是从0开始计数的~

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int m = in.nextInt();
		int[][] graph = new int[n][m];
		int a, b;
		for (int i = 0; i < m; i++) {
			a = in.nextInt();
			b = in.nextInt();
			graph[a-1][i] = 1;
			graph[b-1][i] = -1;
		}
		
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				System.out.print(graph[i][j] + " ");
			}
			System.out.println();
		}
	}

}