搜索资源列表
深度优先搜索、广度优先搜索
- 图的深度优先搜索和广度优先搜索。值得一看。-map the depth-first search and breadth - first search. An eye-catcher.
八数码问题以及双向广度优先算法
- 八数码问题以及双向广度优先算法-8, as well as two-way digital breadth priority algorithm
广度优先算法八数码问题
- 应用广度优先搜索策略：该算法首先根据输入的节点数（该程序可选的有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
迷宫问题的算法(优于广度优先,深度优先,递归)
- 迷宫问题的算法(优于广度优先,深度优先,递归).-maze of algorithm (priority than breadth, depth priority, recursive).
八数码问题以及双向广度优先算法
- 八数码问题以及双向广度优先算法-8, as well as two-way digital breadth priority algorithm
迷宫问题的算法(优于广度优先,深度优先
- 迷宫问题的算法(优于广度优先,深度优先-maze of algorithm (priority than breadth, depth priority
广度优先遍历图
- 广度优先遍历实验报告 供初学者参考，通过对该系统的设计，可以很好的理解树的概念和用途-breadth - first traversal report experimental reference for beginners, the system design can have a very good understanding of the concept of the tree and use
广度优先遍历
- 本程序是实现广度优先遍历算法的全过程，包括图的建立，队列的建立，邻接表的建立，图的遍历等等功能。
九宫格广度优先
- 用c++写的九宫格广度优先程序。有窗口。
数据结构图的邻接矩阵,邻接表存储表示，图的深度优先搜索遍历，广度优先搜索遍历
- 数据结构图的邻接矩阵,邻接表存储表示，图的深度优先搜索遍历，广度优先搜索遍历
tuxingde
- 实现图形的广度优先算法，在此程序中包括结点的搜搜实现过程-The realization of the breadth-first algorithm graphics in this program include node realization process Soso
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
adding_nodes_and_edges
- 通过广度优先算法，不断加入一结点或边，得到指定结点或边数的网络-Through breadth-first algorithm, and continuously adding a node or edge, has been designated node or edge of the network
breadth_first_search
- 通过广度优先算法，遍历网络中的每个结点，得到遍历结点的时间-Through breadth-first algorithm, network traversal each node, the node traversal time
src
- 人工智能中的八数码难题 这个采用的是广度优先以及启发式算法 -Artificial intelligence in the digital challenge of the eight is used, as well as breadth-first heuristic
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
图的广度优先遍历
- 实现图的广度优先遍历程序，c语言编程，图论(A program for realizing the breadth first traversal of a graph)