搜索资源列表
bfs
- 用广度搜索方法实现 找迷宫类游戏 从一点搜索到另一点-With the breadth of search methods to find the maze game from the realization that search to another point
BFS
- 人中智能中交常用的广度优先搜索算法利用vc编译实现-broadth first search
EightPazzelBfs
- This project solve 8 puzzle with breadth first search. I wrote this program for Artificial Intelligence lesson.
heuristics
- CSC 550: Introduction to Artificial Intelligence Fall 2004 heuristics & informed search heuristics hill-climbing bold + informed search potential dangers, variants best first search tentative + informed search best-first search vs.
3
- 设计一个有向图和一个无向图，任选一种存储结构，完成有向图和无向图的DFS（深度优先遍历）和BFS（广度优先遍历）的操作。-Design of a directed graph and an undirected graph, either type of storage structure, the completion of a directed graph and an undirected graph of the DFS (depth-first traversal) and BFS (
dijkstra_b
- 单源最短路径,用于路权相等的情况,dijkstra优化为bfs,邻接表形式,复杂度O(m)-Single-source shortest path for the right of way case of a tie, dijkstra optimization bfs, adjacency list form, complexity of O (m)
basicoperationformap
- 包括了图的大部分基本算法，每一种算法都以邻接矩阵与邻接表两种形式给出，算法包括建图，图的遍历（如DFS和BFS），最小生成树，从某个源点到蓁各顶点的最短路径等-Includes most of the basic graph algorithms, each algorithm is to adjacency matrix and adjacency list is given in two forms, algorithms, including the construction of map
bipartite_graph_maximum_matching
- 三种二项图最大匹配算法.包括使用广度优先搜索以及深度优先搜索的匈牙利算法，以及Hopcroft-Karp算法。-Three of bipartite graph maximum matching algorithms. Including 1.Hungarian with DFS 2.Hungarian with BFS 3.Hopcroft-Karp algorithm
pku1753
- pku 1753 BFS+状态压缩-BFS111111111111111111111111111
zx
- bfs的应用实例 希望大家一起来交流和探讨-bfs application example of hope that we work together to share and discuss
DAGshengchengshu
- 有向图的生成树，有界面显示，采用DFS和BFS两种-Directed graph spanning tree, there are interface display, using two kinds of DFS and BFS
gragh
- 程序功能：1.建立无向非连通图的邻接表存储结构，要求顶点个数不少于15个。 2.用DFS及BFS对此邻接表进行遍历，打印出两种遍历的顶点访问顺序。 3.给定图中任意两个顶点v1和v2及整数k，判断是否存在从v1到v2的路径长度 为k的简单路径，若有打印出路径上的顶点序列(要求路径上不含回路)。 (该功能未能实现)-graph
eightnum
- 三种算法(A*,广度优先,深度优先)求解八数码问题，方便对三种算法的优劣作比较-Three algorithms (A*, BFS, DFS) for Eight digital issues, to facilitate the merits of the three algorithms for comparison
8numcant
- 广度搜索八数码问题，用康托展开判重，哈希表的思想。-BFS 8 digital issues, with Cantor re-start negotiations, hash table ideas.
block
- 最近流行一个Flash游戏，翻木块(本压缩文件里有)。本程序对简化了的翻木块游戏实现自动求解，用的是BFS算法，能求最少步数。-Recently a popular Flash game, turn pieces of wood (the zip file there). This procedure simplifies the translation of the block to solve the game automatically, using a BFS algorithm to
10
- This source code contains: -BFS algorithm on a graph -Edmonds Karp algorithm on a graph -minimal cut on a graph -disjunct paths in a graph.
1
- 图的一些基本功能，包括BFS和DFS搜索-Figure some of the basic functions
8Puzzle7
- BFS搜索实 现8数码游戏的自动求解现8数码游戏的自动求解-Search Real BFS BFS search to achieve 8-digital games are eight digital game automatically solve the automatic solving
eight8
- 用计算机搜索算法解8数码问题（也就是平时玩的拼图），内置2种算法，BFS和A*，是XJTU人工智能导论课的大作业。-Computer search algorithm for solving the problem of digital 8 (that is usually playing the puzzle), built-in two kinds of algorithms, BFS and A*, is the introduction course of artificial inte
BFS
- 人工智能中的宽度优先搜索算法，保证原创，开源共享-Artificial Intelligence in the breadth-first search algorithm to ensure the original, open-source sharing