Location:
Search - tubianli
Search list
Description: 以邻接表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-table adjacent to the structure for storage, connectivity to the map without the depth and breadth of priority priority traversal. Users designated as a starting point node, the output of each traverse the nodes visit Spanning Tree sequence and the corresponding set of edges.
Platform: |
Size: 82749 |
Author: 李文欢 |
Hits:
Description: 图的遍历的演示（c 语言 数据结构课程设计题）
/*定义图*/
typedef struct{
int V[M]
int R[M][M]
int vexnum
}Graph
/*创建图*/
void creatgraph(Graph *g,int n)
{
int i,j,r1,r2
g->vexnum=n
/*顶点用i表示*/
for(i=1 i<=n i++)
{
g->V[i]=i
}
/*初始化R*/
for(i=1 i<=n i++)
for(j=1 j<=n j++)
{
g->R[i][j]=0
}
/*输入R*/
printf(\"Please input R(0,0 END):\\n\")
scanf(\"％d,％d\",&r1,&r2)
while(r1!=0&&r2!=0)
{
g->R[r1][r2]=1
g->R[r2][r1]=1
scanf(\"％d,％d\",&r1,&r2)
}
}
-graph traversal of the display (c language curriculum design data structures that) / * definition of the map * / typedef s truct V (int int [M] R [M] [M]) int vexnum Graph / * create map * / void creatgraph (Graph * g, int n) (int i, j, r1, r2 g -
Platform: |
Size: 1405 |
Author: 吉庆 |
Hits:
Description: 编制一个演示在连通无向图上访问全部结点操作的程序
Platform: |
Size: 9740 |
Author: ck |
Hits:
Description: C语言编的图遍历程序，对正在学习数据结构的同学也许有帮助！
Platform: |
Size: 11131 |
Author: 朱立富 |
Hits:
Description: 图的深度遍历与广度遍历的链接矩阵和链接表实现
Platform: |
Size: 12770 |
Author: CHENG |
Hits:
Description: 以邻接表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-table adjacent to the structure for storage, connectivity to the map without the depth and breadth of priority priority traversal. Users designated as a starting point node, the output of each traverse the nodes visit Spanning Tree sequence and the corresponding set of edges.
Platform: |
Size: 82944 |
Author: 李文欢 |
Hits:
Description: 图的遍历的演示（c 语言 数据结构课程设计题）
/*定义图*/
typedef struct{
int V[M]
int R[M][M]
int vexnum
}Graph
/*创建图*/
void creatgraph(Graph *g,int n)
{
int i,j,r1,r2
g->vexnum=n
/*顶点用i表示*/
for(i=1 i<=n i++)
{
g->V[i]=i
}
/*初始化R*/
for(i=1 i<=n i++)
for(j=1 j<=n j++)
{
g->R[i][j]=0
}
/*输入R*/
printf("Please input R(0,0 END):\n")
scanf("％d,％d",&r1,&r2)
while(r1!=0&&r2!=0)
{
g->R[r1][r2]=1
g->R[r2][r1]=1
scanf("％d,％d",&r1,&r2)
}
}
-graph traversal of the display (c language curriculum design data structures that)/* definition of the map*/typedef s truct V (int int [M] R [M] [M]) int vexnum Graph/* create map*/void creatgraph (Graph* g, int n) (int i, j, r1, r2 g-
Platform: |
Size: 1024 |
Author: 吉庆 |
Hits:
Description: 编制一个演示在连通无向图上访问全部结点操作的程序-The preparation of a demonstration in the undirected graph connectivity to access all nodes operating procedures
Platform: |
Size: 176128 |
Author: ck |
Hits:
Description: C语言编的图遍历程序，对正在学习数据结构的同学也许有帮助！-C language allocation plans traversal procedures, data structures are learning students might be helpful!
Platform: |
Size: 11264 |
Author: 朱立富 |
Hits:
Description: 图的深度遍历与广度遍历的链接矩阵和链接表实现-Graph traversal depth and breadth of the link traversal matrix and link table to achieve
Platform: |
Size: 285696 |
Author: CHENG |
Hits:
Description: 配合数据结构课程的讲义以程序的形式模拟出算法的图，以及图的遍历的程序-With the data structure of the lecture courses in order to process the form of simulated algorithms map and graph traversal procedure
Platform: |
Size: 402432 |
Author: 李海涛 |
Hits:
Description: 数据结构中课程设计，图的遍历，环境Visual C-Data structure in curriculum design, graph traversal, environmental Visual C++
Platform: |
Size: 922624 |
Author: 潘晓芳 |
Hits:
Description: 对图的邻接表表示进行深度优先遍历和广度优先遍历。-The adjacency list representation of the depth-first traversal and breadth-first traversal.
Platform: |
Size: 2048 |
Author: 缪韩稀 |
Hits:
Description: 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-To adjacent multi-table storage structure for connectivity undirected graph depth-first and breadth-first traversal. User-specified node as a starting point, respectively, under the output of each node traversal sequences and the corresponding spanning tree to access the edge set.
Platform: |
Size: 37888 |
Author: 流小圈 |
Hits:
Description: 图的广度优先和深度优先遍历，首先创建图，然后输出遍历序列-Figure of the breadth and depth of priority priority to traverse, first create figure, and then the output to traverse sequence
Platform: |
Size: 467968 |
Author: 霍国栋 |
Hits: