From list of edges to adjacency matrix#4763
The simple undirected graph is given by the list of its edges. Print its representation as an adjacency matrix.
The first line contains two integers (1 \le n \le 100) - number of vertices and (1 \le m \le n \cdot (n - 1) / 2) - number of edges. Next lines contain pairs of integers, each pair gives one edge of the graph.
Print the adjacency matrix of the graph.
Example 1