c语言邻接矩阵构造无向图,如何从邻接矩阵中创建无向图？

您可以从邻接矩阵表示转换的图形，以基于节点的表示像这样：

#include

#include

using namespace std;

const int adjmatrix[9][9] = {

{0,1,0,0,1,0,0,0,0},

{1,0,1,0,0,0,0,0,0},

{0,1,0,1,0,0,0,0,0},

{0,0,1,0,0,1,0,0,0},

{1,0,0,0,0,0,1,0,0},

{0,0,0,1,0,0,0,0,1},

{0,0,0,0,1,0,0,1,0},

{0,0,0,0,0,0,1,0,0},

{0,0,0,0,0,1,0,0,0}

};

struct Node {

vector neighbours;

/* optional additional node information */

};

int main (int argc, char const *argv[])

{

/* initialize nodes */

vector nodes(9);

/* add pointers to neighbouring nodes */

int i,j;

for (i=0;i<9;++i) {

for (j=0;j<9;++j) {

if (adjmatrix[i][j]==0) continue;

nodes[i].neighbours.push_back(&nodes[j]);

}

}

/* print number of neighbours */

for (i=0;i<9;++i) {

cout << "Node " << i

<< " has " << nodes[i].neighbours.size() <

}

return 0;

}

在这里，图形被表示为具有指向可达邻居节点的指针的节点数组。在设置节点及其邻居指针之后，使用此数据结构来执行所需的图算法，在这个(不重要的)示例中，输出每个节点具有的出站有向边的数量。