Description: 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 Meeting Point is the value to 0 for horizontal, vertical numerical addition to the points except for one point.
To Search:
- [gap] - N of a given real number x1, x2 ... xn,
- [TriangleMoving] - Buffer technology allows the use of doub
File list (Check if you may need any files):
Download