搜索资源列表
图的操作界面
- 图邻接表的建立,深度优先遍历,.广度优先遍历,最小生成树,拓扑排序,单源点到其余各个顶点的最短路径等对图的操作!VC界面!-plans to establish the adjacent table, depth-first traversal. Breadth priority traversal, the minimum spanning tree, topological sorting, single-source all of the rest of the vertices such
0801
- 功能：构造图，并进行图的深度优先遍历（邻接表存储结构），图的广度优先遍历，内附详尽的源代码说明-function : tectonic map, and map depth-first traversal of the (storage structure adjacent table), the breadth of the plan priority traversal, enclosing a detailed note of the source code
linsang
- 很多涉及图上操作的算法都是以图的遍历操作为基础的，此程序演示出图的遍历的过程。通过邻接矩阵存储结构实现数据俄的输入，实现图的深度优先遍历和广度优先遍历过程的演示，对异常输入信息报错。-map of algorithms are plans to traverse the basis for the operation, this procedure demonstrated map out the ergodic process. Through the adjacency matrix of
graphshguang
- 图的深度优先遍历和广度优先遍历，以邻接矩阵方式输入。（按照提示输入）！ -map the depth and breadth traversal priority priority traverse to the adjacency matrix input. (According to the prompt entry)!
tubianli
- 以邻接表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-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 out
GraphMatrix
- 以邻接矩阵作为图的存储结构，根据键盘输入创建图，并深度优先、广度优先遍历该图-matrix as to the adjacent storage structure of the plan, according to the keyboard input to create map and depth of priority, breadth priority traversal of the plan
asdfasxa32
- 掌握图的邻接矩阵的存储结构；实现图的两种遍历：深度优先遍历和广度优先遍历。-master plan adjacency matrix storage structure; Implementation plans of the two traverse : depth-first traversal and breadth traversal priority.
Graph
- VC++编写的数据结构图算法演示系统，可作毕业设计系统，包含深、广度遍历，最小生成树，拓扑排序，最短路径算法。-Graph algorithm operating system,include depth/breath first search,minitree,topsort,shortestpath.
DFS_BFS
- 数据结构图论中，实现邻接矩阵的深度遍历和邻接矩阵广度遍历.-Data structure graph theory, the depth traversal and breadth to achieve adjacency matrix adjacency matrix traversal.
Graph
- 基于Virtual C++的数据结构中图的应用，能实现从文件输入有向图和无向图易邻接表和邻接矩阵的形式在屏幕输出，同时能实现无向图的深度遍历输出和广度遍历输出；kruskal算法和Prim算法实现最小生成树的创建；Dijkstra算法实现最短路径的计算；以及最小偏心距的计算。-Application of data structure of Virtual in C++ based on graph, can be achieved the file input directed graphs
tu
- 图的广度和深度的遍历，图的两种遍历方法，深度遍历，广度遍历-Figure the breadth and depth of traversal, figure of two kinds of traversal methods, depth traversal and breadth traversal
List-the-breadth-traversal
- 用C写的链表广度遍历，输入一张图的相关信息，得到该图的广度遍历-Written in C chain breadth traversal, enter a map-related information, to give breadth to traverse the graph
graph
- 图的构建，包括无向图有向图及其遍历，删除添加结点和边，广度遍历和深度遍历，并可打印出来图的结构-Figure Construction, including undirected graph directed graph traversal and delete nodes and edges add breadth and depth of traversal traversal
polygon
- 在VC++6.0中，设计种子填充算法演示软件，分别演示递归算法、用栈实现非递归【深度遍历】、用队列实现非递归【广度遍历】，绘制简单的多边形-In vc++ 6.0, presentation software design seed filling algorithm, illustrate each recursive algorithm, using stack to realize non-recursive traversal 】 【 depth, with a queue to rea
GrapgTraverse
- 数据结构，以邻接矩阵的方式建立图。对图进行深度遍历和广度遍历。-Data structure, the establishment of adjacency matrix approach. Depth traversal and breadth traversal.
src
- c语言爬虫，使用mysql存储，广度遍历-C language reptiles, the use of mysql storage, breadth of traversal
实验8
- 能实现一系列图的创建以及图的广度遍历以及深度遍历(The ability to create a sequence of diagrams and the breadth of the graph and the depth traversal)
Popstar
- popstar 的广度遍历，深度遍历的效果会比较好(Popstar breadth traversal, depth traversal effect will be better)
MyPro
- c++编程中常用的一些算放，以及一些数据结构，包括了迭代，递归，动态规划等(some algorithm of c++ program)
Graph_Operation
- 采用邻接表方法实现图的存储，进而对图进行深度和广度遍历(The adjacency table method is used to store the graph, and then the depth and breadth of the graph are traversed.)