搜索资源列表
8numbers.rar
- *算法属于一种启发式搜索,它扩展结点的次序类似于广度优先搜索,但不同的是每生成一个子结点需要计算估价函数F,以估算起始结点的约束经过该结点至达目标结点的最佳路径代价;每当扩展结点时,意是在所有待扩展结点中选择具有最小F值的结点做为扩展对象,以便使搜索尽量沿最有希望的方向进行.A*算法只要求产生问题的全部状态空间的部分结点及关系,就可以求解问题了,搜索效率较高。当然由于A*算法中没有回溯,因此某些情况下可能会找不到正确的解过程。
BDFS
- 用邻接表表示无向图的深度优先搜索遍历 有助于大家理解图的优先遍历问题-adjoining table with no plans to the depth-first search traverse help you understand the plans of the priority issues Traversing
maze dfs
- dfs 深度优先搜索!这是走迷宫的基本算法。用广义表建立迷宫,用邻接表建立图,用dfs搜索,许多大学的数据结构作业-dfs depth-first search! Maze This is the basic algorithm. Generalized Table established maze, with the establishment of the adjacent table map, with dfs search, the University of many data str
八数码多算法实现
- 这个程序是从广度优先搜索,深度优先搜索,A算法以及A*算法等多方面算法来解决八数码问题-this procedure is breadth - first search, depth-first search, A and A * algorithm algorithm various algorithms to solve the problem eight digital
5班8号周前平
- 输入一个有向图,用深度优先搜索,判断该图是否为一有圈的图。-importation of a directed graph, with the depth-first search to determine whether the plan is a map of the circle.
RBFS_CODE
- RBFS算法(递归最佳优先搜索:A*家族)和LRTA*算法(联机局部搜索,又名实时学习A*搜索,同为A*家族)实现图的单源最短路径。其中RBFS和LRTA*算法均比狄杰算法效率高! -RBFS algorithm (recursive best first search : * A family) and the LRTA * algorithm (online local search, also known as real-time learning A * search, with t
FenYou
- 用广度优先搜索算法解决两个小孩的分油问题.盲目搜索算法.-with breadth - first search algorithm to solve two children, the sub-Oil. Blind search algorithm.
EightNumbers
- 此软件是八数码软件,图形界面操作,分别用“将牌的距离和”、“不在位将牌数”和“宽度优先搜索”求解八数码问题。-eight digital software, a graphical interface operation, "to the distance and licensing", "will not place the number of licenses" and "width Search" Solving the prob
Win32Maze
- Win32下立体迷宫程序,含自动求解,可求迷宫最短路径和所有路径,分别用广度优先搜索和深度优先搜索两种方法实现,欢迎讨论。-Win32 three-dimensional maze procedure, including automatic solution Stepping maze shortest path and all trails. priorities were used to search breadth and depth-first search in two ways,
haokan
- 试扩充深度优先搜索算法,在遍历图的过程中建立生成森林的左子女-右兄弟链表。算法的首部为 void Graph::DFS ( const int v, int visited [ ], TreeNode<int> * t ) 其中,指针t指向生成森林上具有图顶点v信息的根结点。(提示:在继续按深度方向从根v的某一未访问过的邻接顶点w向下遍历之前,建立子女结点。但需要判断是作为根的第一个子女还是作为其子女的右兄弟链入生成树。) -try to expand the depth-fir
emploeyee1
- 无向图的深度优先搜索,老师写的,绝对没错-undirected graph of the depth-first search, the teacher was absolutely right!
4.67
- 普里姆算法构造最小生成树,无向图的深度优先搜索。数据结构作业答案。老师写的-Primbetov minimum spanning tree algorithm structure, no plans to the depth-first search. Operating data structure answer. Teachers write! !
图的广度搜索
- 图形的广度优先搜寻法-graphics breadth priority search method
BASHUGE1
- 此程序是解决八数码问题的。由于使用广度优先搜索,并且程序中用数组存储节点。所以只能进行比较简单的操作。-eight digital solve the problem. The use of BFS, and procedures with an array storage nodes. Therefore, only for a relatively simple operation.
564561354654
- 包括无向图的深度优先搜索,普里姆算法构造最小生成树,数据结构习题的答案-including undirected graph of the depth-first search, Primbetov tectonic minimum spanning tree algorithm and data structure Exercise answer!
graphSearch
- 实现了图的搜索算法,包括深度优先搜索,广度优先搜索,Dijstra算法,A*算法等较典型的搜索算法,同时可以进行图的输入和编辑等操作,仅供大家参考。-achieve the plan's search algorithm, including depth-first search, breadth - first search algorithm Dijstra, A * algorithm is more typical search algorithm, and can map th
DFSearch
- 数据结构(C++版)的演示程序,详细演示深度优先搜索的具体调用过程,-data structure (C + + version) demonstration program, a detailed demonstration of the depth-first search to the specific call process,
BFSearch
- 数据结构(C++版)的演示程序,详细演示广度优先搜索的具体调用过程,-data structure (C + + version) demonstration program, a detailed demonstration of the breadth - first search specific call process,
MY_AI_Move_box
- 这是我自己编写的 c++builder60环境下的 一个小程序,主要体现了人工智能里的A*宽度优先搜索-This is my own c builder60 prepared by the environment of a small procedure, mainly embodies the artificial intelligence Lane width of the A * search priority
AIbashuma
- 我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个\"扩展数组[4]\"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient