搜索资源列表
graph_adjlist
- 邻接表创建图 通过邻接表存储表示法创建图-adjacent table created by the adjacent table map storage pledged to create map
sting7.doc
- 图的邻接矩阵、邻接表、十字链表、邻接多重链表存储结构表示及其创建算法的c语言实现 图的深度优先搜索遍历算法和图的广度优先搜索遍历算法及C语言实现-the adjacency matrix, the adjacent table, Cross Chain, Listless multiple adjacent storage structure and said the creation algorithm in C Language m
diwuci
- 1）掌握图的邻接矩阵、邻接表、十字链表、邻接多重链表存储结构表示及其创建算法的c语言实现； 2）掌握图的深度优先搜索遍历算法和图的广度优先搜索遍历算法及C语言实现；
kkkk
- 创建邻接表, 采用 广度遍历非递归 或 深度优先搜索
tuDeBianLi
- 以邻接表为存储结构，选择图的类型（有向图或无向图），创建相应的图。对创建的图按深度优先和广度优先的遍历。（文档中含代码）
tu
- 1、 用邻接表作为存储结构创建无向图 2、 分别用深度优先和广度优先遍历无向图
ch7
- 邻接表，邻接矩阵的创建以及对它的一些操作等
graph_adjlist
- 邻接表创建图 通过邻接表存储表示法创建图-adjacent table created by the adjacent table map storage pledged to create map
sting7.doc
- 图的邻接矩阵、邻接表、十字链表、邻接多重链表存储结构表示及其创建算法的c语言实现 图的深度优先搜索遍历算法和图的广度优先搜索遍历算法及C语言实现-the adjacency matrix, the adjacent table, Cross Chain, Listless multiple adjacent storage structure and said the creation algorithm in C Language m
diwuci
- 1）掌握图的邻接矩阵、邻接表、十字链表、邻接多重链表存储结构表示及其创建算法的c语言实现； 2）掌握图的深度优先搜索遍历算法和图的广度优先搜索遍历算法及C语言实现； -1) The master plan of the adjacency matrix, adjacency table, Cross linked lists, adjacency list multiple storage structure and expre
kkkk
- 创建邻接表, 采用 广度遍历非递归 或 深度优先搜索-The creation of the adjacent table, using the breadth of ergodicity or non-recursive depth-first search
tuDeBianLi
- 以邻接表为存储结构，选择图的类型（有向图或无向图），创建相应的图。对创建的图按深度优先和广度优先的遍历。（文档中含代码） -To the adjacent table for the storage structure, select the type of graph (directed graph or undirected graph), create a corresponding map. To create the gr
tu
- 1、 用邻接表作为存储结构创建无向图 2、 分别用深度优先和广度优先遍历无向图-1, with the adjacent table as a storage structure to create undirected graph 2, respectively, with depth-first and breadth-first traversal undirected graph
ch7
- 邻接表，邻接矩阵的创建以及对它的一些操作等-Adjacency list, adjacency matrix, as well as the creation of some of its operations
zuixiaoshengchengshu
- 1． 掌握最小生成树的基本概念。 2． 掌握求最小生成树的方法。 创建一个邻接表用来存放带权图。 -1. Grasp the basic concept of minimum spanning tree. 2. To master the methods for minimum spanning tree. Create an adjacent table used to store with the right plan.
tudexg
- 1.邻接表创建图 2.打印图的信息 3.深度优先遍历图 4.最小生成树 5.邻接矩阵创建无向网-1. Adjacency table to create Figure 2. Print map information 3. Depth-first traversal Figure 4. Minimum Spanning Tree 5. Adjacency matrix to create a non-network
graph
- windows下实现图的所用功能，包括：创建有向图和无向图的邻接表，给出有向图的邻接表,创建出逆邻接表-windows used to achieve chart features, including: creating a directed graph and undirected graph of adjacency list is given with the adjacency table, create a reverse
1207
- 用邻接表创建图的函数,输入完毕后请用广度优先遍历的方法输出顶点序列。-Adjacent table to create a graph function after input output sequence of vertices breadth-first traversal methods.
1130
- 用邻接表创建图的函数,输入完毕后请用深度优先遍历的方法输出顶点序列。-Adjacent table to create a graph with a depth-first traversal function, after entering the output sequence of vertices.
Depth-first-traversal
- 1、编写图的邻接表表示法的数据结构。 2、编写用邻接表创建图的函数 3、用深度优先遍历的方法输出顶点序列-1, write the adjacency table shows the data structure of the Act. 2, written with the adjacent table to create a graph function output sequence of vertices with a