搜索资源列表
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
图搜索策略
- 一个使用Java实现的人工智能的图搜索策略程序——酒九宫图问题 人工智能-图搜索策略-演示程序-使用说明 程序简介 在人工智能领域,对隐式图的搜索是求解问题的一种基本方法,本程序通过使用多种图搜索策略,对 重排九宫问题进行求解,演示了“广度优先搜索”、“深度优先搜索”、“有界深度优先搜索”、 “最好优先搜索”和“局部择优搜索”五种基本的图图搜索策略。 整个程序使用了动画技术,界面设计美观友好,使用方便。-use a Java artificial intelligence plans Searc
八数码多算法实现
- 这个程序是从广度优先搜索,深度优先搜索,A算法以及A*算法等多方面算法来解决八数码问题-this procedure is breadth - first search, depth-first search, A and A * algorithm algorithm various algorithms to solve the problem eight digital
图的操作界面
- 图邻接表的建立,深度优先遍历,.广度优先遍历,最小生成树,拓扑排序,单源点到其余各个顶点的最短路径等对图的操作!VC界面!-plans to establish the adjacent table, depth-first traversal. Breadth priority traversal, the minimum spanning tree, topological sorting, single-source all of the rest of the vertices such
0801
- 功能:构造图,并进行图的深度优先遍历(邻接表存储结构),图的广度优先遍历,内附详尽的源代码说明-function : tectonic map, and map depth-first traversal of the (storage structure adjacent table), the breadth of the plan priority traversal, enclosing a detailed note of the source code
8连通
- 计算8连通区数量 利用深度优先遍历,并对同一8连通区进行标记,当遇到不属于同一连通区且灰度符合要求的则计数加1,分别考察一个点周围的八个点。-8 COMPONENTS calculated using the number of depth-first traversal, and the same eight areas marked connectivity, when they do not belong to the same gray zone, connectivity to m
hsdfhjshdj
- 对深度优先(Depth first) 、宽度优先(Breath first) 、爬山法(Hill Climbing) 、 最佳优先(Best first) 以及A*搜索算法进行分析比较,要求: 给出这几种算法的描述; 根据SearchDemonstration程序中给出的示例,给出各算法的执行过程-priority right depth (Depth first), the width of priority (Breath first), mountaineering (Hill C
5班8号周前平
- 输入一个有向图,用深度优先搜索,判断该图是否为一有圈的图。-importation of a directed graph, with the depth-first search to determine whether the plan is a map of the circle.
有向图从邻接矩阵转换为邻接表后的dfs
- 有向图从邻接矩阵转换为邻接表后再深度优先遍历-a graph from the adjacency matrix conversion of the adjacent#$#!142996#!#$read IntelCPU serial number. Rar!#$#read Intel CPU serial number. Rar read Intel CPU serial number. Read rar Intel CPU serial number. rar
c++buildermaze
- 用C++BUILDER做的一个迷宫,可以实现深度优先,广度优先和启发式搜索算法-C BUILDER do a maze, can achieve priority depth, breadth priority and heuristic search algorithm
jsjj
- 这是关于深度优先调度的程序,是全部完整的,直接就可以在vc++上运行的。-This is the depth of priority scheduling procedures, all complete, it can direct the vc run.
sortling
- 实现图的脱坡排序,深度优先广度优先,以及建立邻接表-achieve slope from the map, in order of priority depth breadth priority, and the establishment of the adjacent table
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
searching
- 这是2个关于搜索算法的实现,为深度优先搜索和宽度优先搜索。希望大家喜欢!-This is a 2 on the implementation of search algorithms for the depth-first search and breadth-first search. Hope everyone likes!
language12-17casesofactual
- 实例12 简单的计算器 实例13 时钟程序 实例14 华氏温度和摄氏温度的相互转换 实例15 SimpleDebug函数应用 第2部分 数值计算与数据结构篇 实例16 常用的几种排序方法 实例17 广度优先搜索及深度优先搜索-Instance 12 Simple calculator Instance 13 Clock program Instance 14 Fahrenhe
graph_C(1)
- 建立无向图的邻接矩阵存储;对已经建立的无向图进行深度优先和广度优先遍历操作。建立有向图的邻接表存储;对已经建立的有向图进行深度优先和广度优先遍历操作。 -Establishment of the adjacency matrix storage on the already established undirected graph depth first and breadth-first traversal operation. Establish a table to store th
dp
- 深度优先搜索和广度优先搜索的代码....(Depth search breadth first search)
无向图
- 无向图的创建,转化为邻接矩阵输出,及深度、广度优先遍历(The creation of undirected graph is transformed into adjacency matrix output and depth and breadth first traversal.)