package from < a href =" https://blog.csdn.net/hihell" target="_blank">
The dream eraser
Storm group based on the GPT "secret"

B. Connected graph.

An upper triangular matrix where the diagonal elements are zero indicates that the graph is undirected, because for every vertex i, if there is an edge from i to j, there must be an edge from j to i, so the adjacency matrix is symmetric and the upper and lower triangular elements are equal. Since the diagonal elements are all 0, there is no self-loop. Since the upper triangular element of the adjacency matrix represents a directed edge, the graph is an undirected graph, and the diagonal elements of the upper triangular matrix are all zero, indicating that the graph has no double edge, that is, each edge only appears once. If and only if the graph is connected, the graph satisfies the upper triangular matrix with zero diagonal elements. Therefore, the graph is a connected graph.