Search - tubianli

Search - tubianli - List

[CSharp] tubianli DL : 0: 以邻接表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-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.
Update : 2008-10-13 Size : 80.81kb Publisher : 李文欢
[OS program] tubianli DL : 0: 图的遍历的演示（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 -
Update : 2008-10-13 Size : 1.37kb Publisher : 吉庆
[Other resource] tubianli DL : 0: 编制一个演示在连通无向图上访问全部结点操作的程序
Update : 2008-10-13 Size : 9.51kb Publisher : ck
[Other resource] tubianli DL : 0: C语言编的图遍历程序，对正在学习数据结构的同学也许有帮助！
Update : 2008-10-13 Size : 10.87kb Publisher : 朱立富
[Other] tubianli DL : 0: 图的深度遍历与广度遍历的链接矩阵和链接表实现
Update : 2008-10-13 Size : 12.47kb Publisher : CHENG
[CSharp] tubianli DL : 0: 以邻接表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-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.
Update : 2025-02-17 Size : 81kb Publisher : 李文欢
[OS program] tubianli DL : 0: 图的遍历的演示（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-
Update : 2025-02-17 Size : 1kb Publisher : 吉庆
[source in ebook] tubianli DL : 0: 编制一个演示在连通无向图上访问全部结点操作的程序-The preparation of a demonstration in the undirected graph connectivity to access all nodes operating procedures
Update : 2025-02-17 Size : 172kb Publisher : ck
[Graph program] tubianli DL : 0: C语言编的图遍历程序，对正在学习数据结构的同学也许有帮助！-C language allocation plans traversal procedures, data structures are learning students might be helpful!
Update : 2025-02-17 Size : 11kb Publisher : 朱立富
[Data structs] tubianli DL : 0: 图的深度遍历与广度遍历的链接矩阵和链接表实现-Graph traversal depth and breadth of the link traversal matrix and link table to achieve
Update : 2025-02-17 Size : 279kb Publisher : CHENG
[Other] tubianli DL : 0: 配合数据结构课程的讲义以程序的形式模拟出算法的图，以及图的遍历的程序-With the data structure of the lecture courses in order to process the form of simulated algorithms map and graph traversal procedure
Update : 2025-02-17 Size : 393kb Publisher : 李海涛
[Data structs] tubianli DL : 0: 数据结构中课程设计，图的遍历，环境Visual C-Data structure in curriculum design, graph traversal, environmental Visual C++
Update : 2025-02-17 Size : 901kb Publisher : 潘晓芳
[Data structs] tubianli DL : 0: 对图的邻接表表示进行深度优先遍历和广度优先遍历。-The adjacency list representation of the depth-first traversal and breadth-first traversal.
Update : 2025-02-17 Size : 2kb Publisher : 缪韩稀
[Data structs] tubianli DL : 0: 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-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.
Update : 2025-02-17 Size : 37kb Publisher : 流小圈
[Data structs] tubianli DL : 0: 图的广度优先和深度优先遍历，首先创建图，然后输出遍历序列-Figure of the breadth and depth of priority priority to traverse, first create figure, and then the output to traverse sequence
Update : 2025-02-17 Size : 457kb Publisher : 霍国栋