搜索资源列表
图搜索策略
- 一个使用Java实现的人工智能的图搜索策略程序——酒九宫图问题 人工智能－图搜索策略－演示程序－使用说明 程序简介 在人工智能领域，对隐式图的搜索是求解问题的一种基本方法，本程序通过使用多种图搜索策略，对 重排九宫问题进行求解，演示了“广度优先搜索”、“深度优先搜索”、“有界深度优先搜索”、 “最好优先搜索”和“局部择优搜索”五种基本的图图搜索策略。 整个程序使用了动画技术，界面设计美观友好，使用方便。-use a Java artificial intelligence plans Searc
深度优先搜索
- 深度优先搜索二叉树-depth-first search Binary Tree
宽度优先
- 宽度优先搜索法见cpp1.cpp文件，在vc6.0环境运行实现-width priority search see cpp1.cpp documents in the operation to achieve environmental vc6.0
深度优先搜索pathfinding
- 人工智能寻路算法，深度优先算法
8Puzzle_DFS 人工智能经典问题八数码的深度优先搜索算法实现
- 人工智能经典问题八数码的深度优先搜索算法实现。没有图形界面。-Classic problem of artificial intelligence, eight digital breadth-first search algorithm. No graphical interface.
SEAL_det_v1.0.rar
- 基于深度优先搜索算法的球形译码，具体文献可以参考03年information thoery上的那篇经典文章,Depth-first search algorithm based on spherical decoding, can refer to specific literature in 2003 on information thoery came across a classic article
pso_pathplanning
- 粒子群(PSO)路径规划。这个是一个局部路径规划，用了深度优先搜索算法，可以走出“陷阱”。-Particle Swarm (PSO) path planning. This is a local path planning, with a depth-first search algorithm, we can get out a
Broad-firstsearch
- 广义优先搜索 广度优先搜索邻居的聚类算法实现-Broad-first search Breadth-First Search neighbor clustering algorithm implementation
guangdusousuo
- 宽度优先搜索算法（又称广度优先搜索）是最简便的图的搜索算法之一，这一算法也是很多重要的图的算法的原型。Dijkstra单源最短路径算法和Prim最小生成树算法都采用了和宽度优先搜索类似的思想-Breadth-first search algorithm (also known as breadth-first search) is the most simple plan, one of the search algorithm, this algorithm is also a lot 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
6.7.1
- 图的深度和广度优先搜索 1.图采用邻接表的存储结构 2.深度优先搜索图 3.广度优先搜索图-1. Graph using adjacency list of the storage structure 2. Depth-first search Figure 3. Breadth-first search graph
8shuma
- 八数码的问题描述，以及解答的源代码。用广度优先搜索-Eight digital descr iption of the problem, as well as answers to the source code. Using breadth-first search
BFS
- 广度优先搜索算法分析；供程序设计人员使用-Breadth-first search algorithm analysis for programmers to use
8PuzzleProblem
- 实现了简单的宽度优先搜索，算法比较简单，课程设计时可用。-To achieve a simple breadth-first search
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
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.
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)