搜索资源列表
Sudoku
- 解数独的源码，使用深度优先搜索解决，有可视化的界面，能够很快的解出数独存在的一组解-Sudoku source, using the depth-first search
C4_5.m
- his algorithm was proposed by Quinlan (1993). The C4.5 algorithm generates a classification-decision tree for the given data-set by recursive partitioning of data. The decision is grown using Depth-first strategy. The algorithm considers all the poss
data_struct7
- 数据结构课后设计题第七章 7.22③ 试基于图的深度优先搜索策略写一算法， 判别以邻接表方式存储的有向图中是否存在由顶 点vi到顶点vj的路径(i≠j)。 注意：算法中涉及 的图的基本操作必须在此存储结构上实现。 实现下列函数： Status DfsReachable(ALGraph g, int i, int j) -Data structure design question after class Chapter 7.22 ③ test graph-b
bashuma
- 分别用深度优先和广度优先来算八数码问题，c++源码-Were depth-first and breadth of the priority issues to count eight digital, c++ source code
DFSforeightnumbers
- 人工智能完成的作业，利用深度优先遍历实现八数码问题，可以设置搜索的深度，计算生成的节点数目。-AI to complete the job, using depth-first traversal for Eight digital problem, you can set the search depth, calculate the number of nodes generated.
8Digit
- 使用了A*,A,深度优先,宽度优先等算法解决八数码，由于高强度的优化,使得运算十分之快，而且功能齐全，界面好看.是上学期俺做的人工智能作业.-The use of A*, A, depth-first, breadth-first algorithm to solve, such as eight digital, high-intensity as a result of the optimization, making a very fast operation, and full-feat
grapher
- 深度优先，广度优先，最短路径，最小生成树的图形演示以及源代码-Depth-first, breadth-first, shortest path, minimum spanning tree, as well as graphical presentation source
1
- 这个程序是从广度优先搜索,深度优先搜索,A算法以及A算法等多方面算法来解决八数码问题-This program is breadth-first search, depth-first search, A algorithm and A algorithm and many other algorithms to solve the problem of digital 8
T-tracking_Ver0.1
- 1、基于深度摄像机的手势跟踪、手势识别、轮廓识别、运动目标坐标输出代码 2、基于Primesense公司深度图 3、技术涉及复杂图形学算法，感兴趣的朋友，希望你们能发展中国自己的识别技术发展。 4、能够运行于Window,Linux,Android系统，全球第一个能够运用Android系统深度摄像的手势跟踪实现代码。 5、有部分OpenCV函数被简化。 6、代码的思路和细节已经有发明专利保护，拒绝完全抄袭，希望在此基础上大家创新-1, the depth of the cam
graph
- 实现图的深度优先遍历和图的广度优先遍历的控制台应用程序-Graph depth-first traversal and graph breadth-first traversal of the console application
dfstraverse
- 完成输入图，然后进行图的深度优先遍历-Complete the input map, and then proceed to map the depth-first traversal
graphsearch
- 包含图的深度优先探索遍历和广度优先探索遍历，能从图中的任一顶点出发访问图中所有顶点-Includes plans to explore the depth-first traversal and breadth-first traversal to explore, from the graph the starting point of any visit to Figure 1 for all vertices
sudoku1
- 数独求解代码，用深度优先搜索数独问题的解，求得唯一解-Solving Sudoku code, using depth-first search solution Sudoku problem, find a unique solution
SinaBlogFirstCollecting
- Sina博客爬虫,基于C#编写.实现功能是通过回帖发现新用户,然后按深度优先抓取各个用户的所有信息.需要SQL Server-Sina blog reptiles, based on the C# Prepared. The realization of function is to discover new users through the replies, and then by depth-first crawl all the information each user. The ne
src
- 商人过河问题是数学建模中的一个经典问题，程序利用链表存储渡河状态，使用穷举的算法实现。该算法会找出N个商人/随从渡河的一个可行方案，但并不保证是最佳方案。写完这个程序后让我想到的居然是图的深度优先搜索，二者在查找的思想上是类似的。-Merchants across the river mathematical modeling problem is a classic problem, the use of list storage procedures to cross the river,
8digits
- 人工智能，深度优先算法，VS2005做的，还能用-Artificial intelligence, depth-first algorithm, VS2005 do, but also with
graph
- 图的各种存储结构，特别要熟练掌握邻接矩阵和邻接表存储结构。 遍历是图各种应用的算法的基础，要熟练掌握图的深度优先遍历-Map a variety of storage structures, in particular to master the adjacency matrix and adjacency list storage structure. Graph traversal is a wide range of applications based on algorithms,
graph
- 数据结构C对图的操作算法，有广度、深度优先遍历，拓扑排序，最短路径的实现算法，最小生成树的算法-C data structures to operate on the map algorithm, there is the breadth, depth-first traversal, topological sorting, shortest path algorithm, minimum spanning tree algorithm
graph_
- //有向图:有向图,无向图基本操作 //运行环境：VC //有向图,无向图基本操作,包括: //1、邻接矩阵 //2、邻接表 //3、深度优先遍历 //4、广度优先遍历 //5、最小生成树 //6、拓扑排序 //7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-//Directed graph: directed graph, undirected graph basic operation// Operating Environme
minop
- 最少运算问题 主要是深度优先搜索迭代加深的运用-At least the problem is that computing depth-first search Iterative deepening the use of