搜索资源列表
tubianli
- 以邻接表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-table adjacent to the structure for storage, connectivity to the map without the depth and breadth of priority priority traversal. Users designated as
tubianli
- 图的遍历的演示（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&
tubianli
- 编制一个演示在连通无向图上访问全部结点操作的程序
tubianli
- C语言编的图遍历程序，对正在学习数据结构的同学也许有帮助！
tubianli
- 图的深度遍历与广度遍历的链接矩阵和链接表实现
tubianli
- 以邻接表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-table adjacent to the structure for storage, connectivity to the map without the depth and breadth of priority priority traversal. Users designated as
tubianli
- 图的遍历的演示（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&
tubianli
- 编制一个演示在连通无向图上访问全部结点操作的程序-The preparation of a demonstration in the undirected graph connectivity to access all nodes operating procedures
tubianli
- C语言编的图遍历程序，对正在学习数据结构的同学也许有帮助！-C language allocation plans traversal procedures, data structures are learning students might be helpful!
tubianli
- 图的深度遍历与广度遍历的链接矩阵和链接表实现-Graph traversal depth and breadth of the link traversal matrix and link table to achieve
tubianli
- 配合数据结构课程的讲义以程序的形式模拟出算法的图，以及图的遍历的程序-With the data structure of the lecture courses in order to process the form of simulated algorithms map and graph traversal procedure
tubianli
- 数据结构中课程设计，图的遍历，环境Visual C-Data structure in curriculum design, graph traversal, environmental Visual C++
tubianli
- 对图的邻接表表示进行深度优先遍历和广度优先遍历。-The adjacency list representation of the depth-first traversal and breadth-first traversal.
tubianli
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-To adjacent multi-table storage structure for connectivity undirected graph depth-first and breadth-first traversal. User-specified node as a startin
tubianli
- 图的广度优先和深度优先遍历，首先创建图，然后输出遍历序列-Figure of the breadth and depth of priority priority to traverse, first create figure, and then the output to traverse sequence