The root of the adjacency matrix class is A djacency WD igraph, so we start with this class. Program 1 2 - 1 gives a description of the class. In the program, the function Make2DArray in Program 1 - 1 3 is used to allocate space for the two-array a, and then the array a is initialized to describe the adjacency matrix of a graph with n vertices and no edges, with a complexity of (n2). This code does not catch exceptions that may be caused by Make 2 D A rray. The two-dimensional array release function Delete 2 D in Program 1 - 1 4 is called in the destructor.
You Might Like
Recommended ContentMore
Open source project More
Popular Components
Searched by Users
Just Take a LookMore
Trending Downloads
Trending ArticlesMore