给出一个图的邻接矩阵，找出该图的汇点，即入度为0，出度为n－1的点。 从图的邻接矩阵中很容易看出：汇点就是横向数值都为0，纵向数值除该点外其余都为1的点。 -Give a graph adjacency matrix to find out The Meeting Point, which is 0-degree, out-degree for the n-1 points. From the graph adjacency matrix, it is easy to see: the