搜索资源列表
图搜索策略
- 一个使用Java实现的人工智能的图搜索策略程序——酒九宫图问题 人工智能－图搜索策略－演示程序－使用说明 程序简介 在人工智能领域，对隐式图的搜索是求解问题的一种基本方法，本程序通过使用多种图搜索策略，对 重排九宫问题进行求解，演示了“广度优先搜索”、“深度优先搜索”、“有界深度优先搜索”、 “最好优先搜索”和“局部择优搜索”五种基本的图图搜索策略。 整个程序使用了动画技术，界面设计美观友好，使用方便。-use a Java artificial intelligence plans Searc
广度优先算法八数码问题
- 应用广度优先搜索策略：该算法首先根据输入的节点数（该程序可选的有3X3，4X4…9X9几种节点数），然后输入初始状态和终点状态-application breadth - first search strategies : The first algorithm based on the input nodes (which are optional procedures 3X3, 4X4 ... Frankfurt several nodes), then the initial state
宽度优先
- 宽度优先搜索法见cpp1.cpp文件，在vc6.0环境运行实现-width priority search see cpp1.cpp documents in the operation to achieve environmental vc6.0
minop
- 最少运算问题 主要是深度优先搜索迭代加深的运用-At least the problem is that computing depth-first search Iterative deepening the use of
ldfs
- 基于学习的深度优先搜索算法，一种通用的启发式搜索算法用于确定的，非确定以及MDPs环境中-Learning Depth-First Search:A Unified Approach to Heuristic Search in Deterministic and Non-Deterministic Settings,and its application to MDPs
src
- 人工智能中重要的一个问题, 用广度优先搜索的方法解决-Artificial Intelligence an important question, with breadth-first search methods to solve
TSP
- 由图的邻接矩阵表示下广度优先搜索遍历改编来求TSP问题的近似解-Improve Breadth first searching graph algorith to solve TSP problem
8shuma
- 八数码的问题描述，以及解答的源代码。用广度优先搜索-Eight digital descr iption of the problem, as well as answers to the source code. Using 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
search_graph
- 一个python程序，实现了无向图的结构模拟，以及广度优先搜索的算法，以及显示最短路径之一。用leo+ulipad实现。-A python program to realize the structure of an undirected graph simulation, as well as the breadth-first search algorithm, and display one of the shortest path. By leo+ ulipad achieved.
KSE1.0(SRC)
- 数独探索者，快速解数独的小程序。使用哈希表优化的深度优先搜索算法。-Sudoku Explorer 1.0
language12-17casesofactual
- 实例12 简单的计算器 实例13 时钟程序 实例14 华氏温度和摄氏温度的相互转换 实例15 SimpleDebug函数应用 第2部分 数值计算与数据结构篇 实例16 常用的几种排序方法 实例17 广度优先搜索及深度优先搜索-Instance 12 Simple calculator Instance 13 Clock program Instance 14 Fahrenhe
flow_trade
- 对一电力网络实现顺流跟踪，计算分流比例因子，深度优先搜索供电路径，计算发电机在负荷中的分配比例等。-Downstream of a power network tracking, triage scale factor calculation, depth-first search powered path, calculating the distribution of generators in the load ratio.
DFS
- 有界深度优先搜索，将八数码问题简化成三数码问题(Bounded depth first search simplifies eight digital problems into three digital problems)
WFS
- 广度（宽度）优先搜索，将八数码问题简化成三数码问题求解(Breadth (range) first search simplifies the eight digital problem into three digital problem solving)
6_7
- 实现数据结构 中图结构的邻接表存储结构算法，以及深度优先遍历算法。(The adjacency table storage structure algorithm for the graph structure in the data structure and the depth first traversal algorithm are realized.)
DFSMaze
- C++实现深度优先搜索迷宫，找到最短路径。(C++ implements the depth first search maze and finds the shortest path)
DFS
- 通过文件中的信息，进行搜索可达路径，行走过的正确路径标记为1，错误的路径标记为2(Through the information in the file, the search reachable path is searched, the correct path to walk is marked as 1, and the wrong path is marked 2)
dp
- 深度优先搜索和广度优先搜索的代码....(Depth search breadth first search)
广搜
- 这是一份广度优先搜索的代码，代码很简单，很容易就能理解广搜的核心。(This is a breadth first search algorithm, the code is very short, it is easy to understand the core of Guang search.)