63. 인접행렬 [재귀 & 깊이/넓이 우선탐색(DFS, BFS)

나의정답.

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>

using namespace std;

int main(int argc, char** argv) {
	//freopen("input.txt", "rt", stdin);
	int n, m;
	int a, b, c;
	int row, col;
	scanf("%d %d", &n, &m);
	row = n;
	col = n;

	int** map = new int* [row];
	for (int i = 0; i < row; i++)
		map[i] = new int[col];

	for (int i = 0; i < row; i++)
	{
		for (int j = 0; j < col; j++)
			map[i][j] = 0;	
	}

	
	for (int i = 0; i < m; i++) {
		scanf("%d %d %d", &a, &b, &c);
		map[a - 1][b - 1] = c;
	}

	for (int i = 0; i < row; i++)
	{
		for (int j = 0; j < col; j++)
			printf("%d ", map[i][j]);
		printf("\n");
	}
		

	for (int i = 0; i < row; i++)
		delete[] map[i];
	delete[] map;
}