搜索资源列表
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
shendu
- 在VC界面上实现深度优先搜索、广度优先搜索的功能，操作简单方便-in VC interface to achieve depth-first search, breadth - first search function is easy and simple
BFSTraverse.CPP
- 深度优先遍历。包含深度优先遍历的源代码，-depth-first traversal. Depth-first traversal contains the source code,
guohewenti
- 试运用深度优先搜索算法寻找过河问题的一个解决方案，题目叙述如下：猎人、狗、男人带着男孩1、男孩2，女人带着女孩1、女孩2，一共8个个体。一艘小船，一次只能过两个个体，狗和四个小孩不会划船。注意：（1）猎人不在，狗咬任何人；（2）男人不在，女人打男孩；（3）女人不在，男人打女孩。-Test the use of depth-first search algorithm to find a solution to cross the river problem, topics are describ
SinaBlogFirstCollecting
- Sina博客爬虫,基于C#编写.实现功能是通过回帖发现新用户,然后按深度优先抓取各个用户的所有信息.需要SQL Server-Sina blog reptiles, based on the C# Prepared. The realization of function is to discover new users through the replies, and then by depth-first crawl all the information each user. The ne
712
- 编写一个算法程序实现： 1、 用邻接表存储下图： 2、完成对以上图的深度优先搜索，设出发顶点是V1。 -Procedures for the preparation of an algorithm to achieve: 1, with adjacent storage under the map table: 2, completion of the above graph depth-first search, set the start
hu
- 算法深度优先找出从顶点u到v 的简单路径，是用c编写的 -Depth-first algorithm to find v from vertex u to a simple path is c prepared
erchashu
- 本文利用C语言实现了简单的二叉树，每个结点只保存一个整数，并且，由于非常简单，树的根结点是确定的，而不是输入的。确定根结点以后，用户输入的每一个数都被insert到树中（-999表示停止），利用深度优先的方法。建立好二 叉 树以后，分别利用深度优先（DFS）和广度优先（BFS）进行了遍历，输出结果。-In this paper, the use of C language realization of a simple binary tree, each node only maintains
graphy
- C++ 关于图的广度优先 深度优先 遍历的一些代码 很不错-C++ on the graph breadth-first depth-first traversal of some of the code is very nice
DFS
- DFS算法的非递归函数。DFS是求树的深度的深度优先算法-DFS algorithm of non-recursive function. DFS is seeking the depth of the tree depth-first algorithm
tu
- 用C语言编程一个有向图如下，功能要求如下：输入并生成该图；深度优先遍历；广度优先遍历； -With the C programming language as a directed graph, functional requirements are as follows: input and generate the map depth-first traversal breadth-first traversal
rrrrrrr
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-table storage structure, connectivity undirected graph depth first and breadth-first traversal. User-specified node as a starting point, respectively, under
tubianliyanshi
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-table storage structure, connectivity undirected graph depth first and breadth-first traversal. User-specified node as a starting point, respectively, under
DFTravel
- 代码可以实现有向图及无向图的深度优先收缩-Code can achieve a directed graph and undirected graph depth-first contraction
tu
- 分别写出用邻接矩阵和邻接表做图的存储结构，并分别实施广度优先遍历和深度优先遍历。-Write down made graph adjacency matrix and adjacency list storage structure, and implement the depth-first traversal and breadth-first traversal
Adjacency-matrix
- 分别以邻接矩阵和邻接表的存储结构建立图。 分别对图进行深度优先遍历和广度优先遍历。 求图中边的数目。 求顶点0到图中其余每个顶点的最短路径-Respectively adjacency matrix and adjacency list storage structure created map. Respectively graph depth-first traversal and breadth-first traversal. In the figure, the numbe
first
- 若用有向网表示网页的链接网络，其中顶点表示某个网页，有向弧表示网页之间的链接关系。试设计一个网络蜘蛛系统，分别以广度优先和深度优先的策略抓取网页。-If there indicate that the page with links to the network to the network, where the vertices represent a page, there are links to the arcs represent relationships between pages
Denoising
- 简单的c#实现的图像去噪声软件，利用深度优先搜索算法-a simple c# software of image denoising using the depth first search algorithm
Graph
- 基于Virtual C++的数据结构中图的应用，能实现从文件输入有向图和无向图易邻接表和邻接矩阵的形式在屏幕输出，同时能实现无向图的深度遍历输出和广度遍历输出；kruskal算法和Prim算法实现最小生成树的创建；Dijkstra算法实现最短路径的计算；以及最小偏心距的计算。-Application of data structure of Virtual in C++ based on graph, can be achieved the file input directed graphs
3
- 1.创建一个二叉树 2.可以生成先序遍历二叉树 3.可以生成中序遍历二叉树 4.可以生成后序遍历二叉树 5.计算二叉树的结点总数和叶点数 6.可以建立无向图的邻接矩阵 7.可以生成深度优先遍历图-1. Create a binary tree 2. The first sequence can be generated traversing binary tree 3. Can be generated in order traversing binary tre