1, correct. Because if it's undirected, then A can go to B, and B can go to A, and it has to be an even number of ones, which is symmetric. And the graph says that this edge is going from A to B, and B can't go to A, which is an odd number of ones in the adjacency matrix, so it's not symmetric. To sum up, I think the graph corresponding to the asymmetric adjacency matrix is a directed graph, By < a href = "https://blog.csdn.net/wd1603926823/article/details/128782281" Target = "_blank" > < span > https://blog.csdn.net/wd1603926823/article/details/128782281 < / span > < / a > so easily knowable.
2, loading factor
28, B
29, A
