rar

The root of the adjacency matrix class is A djacency WD igraph

  • 2014-03-05
  • 1.06KB
  • Points it Requires : 2

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.

unfold

You Might Like

Uploader
csdn_can
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×