搜索资源列表
图形操作
- 采用邻接矩阵或是十字链表实现图的深度优先遍历或广度优先遍历。
GraphTrace.rar
- 用标准C++完成对图的深/广度优先搜索,使用邻接多重表的存储结构,Using standard C++ Completion of the map deep/breadth-first search, the use of the adjacent multi-table storage structure
c.zip
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出各种遍历下的结点访问序列和相应生成树的边集,To the adjacent multi-table for the storage structure, to achieve connectivity of undirected graph depth-first and breadth-first traversal. To user-specified node as a starting poi
tubianli
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-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 t
Dijkstra
- 计算图中两点间的最短路径,采用邻接链表存储结构.-Calculation chart the shortest path between two points using adjacent storage structure list.
ALGraph
- 邻接链表图的代码实现，VC++开发平台，C语言描述的数据结构。-Source implementation of the adjacency lists map, VC++ development platform, the C language to describe the data structure.
graph
- 图的邻接链表及遍历及基本操作，节点的插入删除等基本操作，适合初级算法学习者-Adjacency list graph and traversal and basic operations, insertion node to delete such basic operations, suitable for primary algorithm learners
yuio
- * 函数功能: 深度优先遍历邻接链表表示的图 * 输入参数: Graph_A G 邻接链表表示的图 -* Function: depth-first traversal of the graph adjacency list that* input parameters: Graph_A G said adjacency list of graph
youxiangtuopupaixu.txt
- 有向图的拓扑排序 通过邻接链表 排序-Directed graph topological sort to sort through the adjacency list
create_algraphic
- 图的建立，里面包括有向图和无向图的建立，还有带权值的建立方法，也有图的输出算法，图的存储结构是以邻接链表的形式存储的。-The establishment of plans, which include the maps and the establishment of undirected graph, as well as with the establishment of methods of weight, but also the output graph algorithms, ma
graph
- 图： 调试图的邻接链表存储的程序，解决下列问题： 根据教科书P157页的G2图（无向图），输入数据运行程序；再适当修改程序使它适用于G1图（有向图），输入数据运行程序。-Adjacency list graph debug stored procedures, to address the following issues: According to the textbook page G2 Fig P157 (undirected graph), input data to run pro
xiaoyuandaohangxitong
- 本课程设计的内容为“校园导航”，校园平面图中取大学的11个常去地点，其略图如图1,图中已标出主要路线，各路线的长度如表１中所示。任务定义：找出从任意场所到达另一场所的最佳路径（最短路径）。显然要解决这一问题要用“邻接矩阵”来存储各点间的距离，然后用Ｄijkstra求出最短路径。-The content of the curriculum design for the " Campus Map" plan of the campus from the University of
code
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-sheet for the storage structure, to achieve connected undirected graph depth-first and breadth-first traversal. To user-specified node as a starting point, r
graph
- 用邻接多重表实现图的存储、遍历。网上和相关参考书中很少有这方面内容。-Achieved with the adjacent multi-sheet map of the store, traverse. Related reference books online and there are few elements in this respect.
directed_network
- 以邻接矩阵的方式确定有向网，完成： A．建立并显示出它的邻接链表； B．以非递归方式进行深度优先遍历，显示遍历的结果，（并随时显示栈的入出情况）； C．对该图进行拓补排序，显示拓补排序的结果，并随时显示入度域的变化情况； D．给出某一确定顶点到所有其他顶点的最短路径-Adjacency matrix to determine a directed network, the completion of: A. To establish and demonstrate its adj
4
- 无向图功能实现，用邻接多重表存储该无向图，并使用动态存储结构。用一个单链表把所有顶点存储起来，在存储边的节点中给出该边的两个顶点的各自的下一条边的节点地址。-Undirected graph implementation of function, with the adjacent multi-table to store the graph, and using dynamic storage structures. With a single list of all vertices sto
Wuxiangtu
- 数据结构经典实例，以无向图的邻接多重表存储无向图。以数偶的形式依次从键盘上输入一串数据。如：(A，B)为从起始结点（其数据场之值为一大写的英文字母 A ），到终止结点（其数据场之值为一大写的英文字母 B）的无向边。最后输入（Z，Z）表示输入结束。-Classic examples of data structures in order to free the adjacency table to store multiple undirected graph. Followed by a fe
TTU
- 《数据结构》课程设计 建立并显示出有向图的邻接链表； 对该图进行拓扑排序，显示拓扑排序的结果，并随时显示入度域的变化情况； 给出它的关键路径（要求：显示出VE,VL,E,L,L-E的结果）。-" Data Structure" Course Design has established and demonstrated to the adjacency list the topological sort graph shows the results of top
Cpp1
- 已知一以动态存储结构形式存储的，以邻接多重表表示的无向图。请用KRUSKAL算法求出它的最小代价生成树。-Storage structure known to form a dynamic storage to multiple tables that non-adjacent to the graph. Please KRUSKAL algorithm solves the minimum cost spanning tree.
Adjacent-multi-table
- 邻接多重表，基于C++平台，使用动态存储结构，可以无误运行-Adjacent multi-table, based on C++ platform, using dynamic storage structures can be run correctly