搜索资源列表
tu
- 实现了图的创建，深度优先搜索和广度优先搜索-To create a graph, depth-first search and breadth-first search
12
- 此程序从国外网站收集得到，是标准的深度优先搜索算法，可实现节点遍历和检测回路的功能，详细情况请看原英文注释 我在此程序中添加了随机性，即遇到分叉时，随机选下一个节点，成为随机深度优先搜索算法-This procedure has been collected from the foreign website, the standard depth-first search algorithm, can be achieved and the detection circuit node t
DFS
- 图论编程，包含文件操作，建立图的邻接表，并实现深度优先搜索-Graph theory programming, including file operations, the establishment of plans of the adjacent table, and the depth-first search
COLORING
- 图用邻接矩阵表示，程序逻辑为，首先实现了用于确定一种有效颜色的函数color（），然后，按照深度优先和违反约束则回溯的策略进行搜索。-Map with the adjacency matrix that logic to, first of all to achieve the color used to determine the function of an effective color (), and then, in accordance with the depth-first an
shensou
- 深度优先搜寻的模板，深搜可以解决很多图的问题，可以遍历图中的任意位置，从而解决问题-Depth-first search template, deep search problems can be solved a lot of plans, you can traverse the graph of an arbitrary position to solve the problem
travle
- 深度优先遍历和广深优先遍历的实现及实现源代码-travle
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
oula
- 随机生辰欧拉图，通过深度优先遍历来求欧拉回路-Random birthday Euler diagram, depth-first traversal through the pursuit of Euler circuit
shenyou
- 求解数独的深度优先搜索的程序，没有递归，可用于低性能的单片机。-Sudoku Solving the depth-first search procedure, there is no recursion, can be used for low performance microcontroller.
main
- poj2676:sudoku.深度优先搜索和剪枝.正确程序.-poj2676:sudoku.Depth First Search.Accepted program.
DFSBFS
- 关于数据结构搜索方法中的深度优先搜索及广度优先搜索的算法及比较,c语言描述,简单易懂.-Search method on the data structure in the depth-first search and breadth-first search algorithm and comparison, c language to describe, easy to understand.
Graph
- 图的大部分实现 图的深度优先周游 图的广度优先周游 由队列方式实现的拓扑排序 由深度优先搜索方式实现的拓扑排序 单源最短路径(Dijkstra算法) 每对顶点之间的最短路径(Floyd算法) 最小支撑树(Prim算法) 最小支撑树(Kruskal算法)-Figure most of the implementation diagram of the depth-first breadth-first tour travel map be achieved by the topological s
DFS_Frame
- 深度优先的程序实例，供大家参考-Depth-first examples of procedures for your reference
1
- 1.建立一个无向图的邻接表存储 2。对该图进行深度优先搜索，按顺序输出所访问的-1. The establishment of an undirected graph in adjacency list is stored 2. Depth-first search of the graph, according to the order of the output of the visit
Graph2vertexpathproblem
- 试基于图的深度优先搜索策略编写一程序，判断以邻接表方式存储的有向图中是否存在 由顶点Vi到Vj顶点的路径。 -Test graph-based depth-first search strategy for the preparation of a program to determine ways to adjacency list stored in the existence of a directed graph from vertex Vi to vertex Vj pat
eight_depth
- 用C语言实现深度优先算法，八数码问题，作者：陈华昌-C language implementation with depth-first algorithm, 8 digital issues, Authors: Chen Huachang
shenduyouxiansoushuo
- 计算机学院大二数据结构程序实现深度优先算法-Sophomore Computer Science program data structure to achieve depth-first algorithm
GraphTravell
- 图基于邻接表的创建以及深度优先遍历和广度优先遍历-Graph based on adjacency list creation, as well as depth-first traversal and breadth-first traversal
depth_first_search_algorithm
- 网络算法中关于深探分枝（深度优先搜索）的算法实现。-This algorithm discribes depth-first search.
Intelligence
- 人工智能课程大作业。一个拼图游戏，分为自动和手动。若选择自动，则可根据深度优先和广度优先的办法自动完成拼图步骤-Artificial Intelligence course great job. A jigsaw puzzle, is divided into automatic and manual. If you choose automatically, by virtue of the depth-first and breadth-first approach to auto-comp