Location:
Search - depth first
Search list
Description: 深度优先搜索算法解决八码难题-depth-first search algorithm to solve eight problems yards
Platform: |
Size: 2048 |
Author: 高兵 |
Hits:
Description: java的DFS(Depth-first search )和BFS(Breadth-first search)的实现-the DFS (Depth-first search) and BFS (Breadth-first search) Implementation
Platform: |
Size: 6144 |
Author: Rachel |
Hits:
Description: 深度优先搜索二叉树-depth-first search Binary Tree
Platform: |
Size: 144384 |
Author: 张小成 |
Hits:
Description: 有许多是考研要用的！三路归并算法，快速排序的非递归算法，无向连通图的非递归的深度优先遍历等，，希望大家用得着-many are taking tests to use! Three road merging algorithm, rapid sequencing of non- recursive algorithm, undirected graph of the non- recursive depth-first traversal, and we hope that it needs! !
Platform: |
Size: 6144 |
Author: 马号 |
Hits:
Description: 用邻接表表示无向图的深度优先搜索遍历 有助于大家理解图的优先遍历问题-adjoining table with no plans to the depth-first search traverse help you understand the plans of the priority issues Traversing
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 图的深度优先搜索和广度优先搜索。值得一看。-map the depth-first search and breadth- first search. An eye-catcher.
Platform: |
Size: 175104 |
Author: 乐天 |
Hits:
Description: 计算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 meet the requirements will increase one count, a study of around eight points.
Platform: |
Size: 137216 |
Author: 陈新 |
Hits:
Description: 对深度优先(Depth first) 、宽度优先(Breath first) 、爬山法(Hill Climbing) 、
最佳优先(Best first) 以及A*搜索算法进行分析比较，要求： 给出这几种算法的描述；
根据SearchDemonstration程序中给出的示例，给出各算法的执行过程-priority right depth (Depth first), the width of priority (Breath first), mountaineering (Hill Climbing), the best priority (Best first) and the A* search algorithm analysis, requirements : This is the description of several algorithms; According SearchDemonstration procedures given in the examples are given of the algorithm implementation process
Platform: |
Size: 1748992 |
Author: yao |
Hits:
Description: 实现了图的搜索算法，包括深度优先搜索，广度优先搜索，Dijstra算法，A*算法等较典型的搜索算法，同时可以进行图的输入和编辑等操作，仅供大家参考。-achieve the plan's search algorithm, including depth-first search, breadth- first search algorithm Dijstra, A* algorithm is more typical search algorithm, and can map the input and editing operation, only for reference.
Platform: |
Size: 96256 |
Author: 王墨村 |
Hits:
Description: A program to find frequent itemsets (also closed and maximal) with the eclat algorithm ,which carries out a depth first search on the subset lattice and determines the support of itemsets by intersecting transaction lists. -A program to find frequent itemsets (also c losed and maximal) with the eclat algorithm, which carries out a depth first search on the sub set lattice and determines the support of items ets by intersecting transaction lists.
Platform: |
Size: 31744 |
Author: 无心 |
Hits:
Description: 图论中二种遍历图的算法.深度优先遍历,与广度优先遍历.-graph theory two species traverse map algorithm. Depth-first traversal, and the breadth- first traversal.
Platform: |
Size: 2048 |
Author: 张新 |
Hits:
Description: Implemented BFS, DFS and A*
To compile this project, use the following command:
g++ -o search main.cpp
Then you can run it:
./search
The input is loaded from a input file in.txt
Here is the format of the input file:
The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm.
The second line of input file shoud be an integer m indicate the number of connections for the map.
Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist.
The following input are for A*
The following line contains two chars indicate the source and destination city for A* algorithm.
Then there is an integer h indicate the number of heuristic.
The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
-Implemented BFS, DFS and A* To compile this project, use the following command: g++-O search main.cppThen you can run it:./SearchThe input is loaded from a input file in.txtHere is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm.Then there is an integer h indicate the number of heuristic.The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
Platform: |
Size: 3072 |
Author: bo |
Hits:
Description: 图的操作,包括,图的基本存储方法,有关图的操作算法并用C语言编程实现,图的搜索路径的遍历方法,以邻接矩阵和邻接表的方式存储连通图。然后分别用优先深度算法遍历邻接矩阵方式存储的图和邻接表方式存储的图。深度优先遍历的递归算法 （1）深度优先遍历算法（2）邻接表表示的深度优先搜索算法（3）邻接矩阵表示的深度优先搜索算法.-plan of operation, including, map the basic storage methods, the operation of the map algorithm and C language programming. map of the search path traversal methods to the adjacency matrix and adjacency list of storage connected graph. Then, using the priority traversal algorithm depth of the matrix adjacent to the storage map and the adjacent forms storage plans. Depth-first traversal of the recursive algorithm (1) depth-first traversal algorithm (2) adjoining table depth-first search algorithm ( 3) adjacency matrix of depth-first search algorithm.
Platform: |
Size: 1024 |
Author: 林静 |
Hits:
Description: JAVA 深度優先搜索實例
JAVA Depath First Search-JAVA depth-first search examples JAVA Depath First Search
Platform: |
Size: 1024 |
Author: Siu BB |
Hits:
Description: 对图的深度优先遍历 基于堆栈 非堆栈 两种实现-On the graph depth-first traversal of non-stack based on the stack of two to achieve
Platform: |
Size: 1024 |
Author: 杨平安 |
Hits:
Description: 深度优先搜索算法Matlab源码
％ 此程序从国外网站收集得到，是标准的深度优先搜索算法，可实现节点遍历和检测回路的功能，详细情况请看原英文注释
％ 我在此程序中添加了随机性，即遇到分叉时，随机选下一个节点，成为随机深度优先搜索算法-Depth-first search algorithm Matlab source this procedure site collected from abroad, is the standard depth-first search algorithm, can be achieved and the detection circuit node traversal functions, details see the original English Notes I added this procedure randomness, that is, bifurcation encountered when a randomly selected node, become a random depth-first search algorithm
Platform: |
Size: 2048 |
Author: tangjia |
Hits:
Description: 图的深度优先遍利 图的深度优先搜寻法 有注释-Fig times the depth of Victoria map priority depth-first search method has the Notes
Platform: |
Size: 1024 |
Author: mailan7749 |
Hits:
Description: 图的算法的基本训练
1、 图的存储结构的定义和图的创建
图的种类有：有向图、无向图、有向网、无向网。
图的存储结构可采用：邻接矩阵、邻接表。
要求：分别给出邻接矩阵和邻接表在某一种图上的创建算法
2、 图的遍历：非递归的深度优先搜索算法、广度优先搜索算法。
3、 图的深度遍历的应用：求无向连通图中的关节点（教材P177-178,算法7.10和7.11）
4、 图的广度遍历的应用：给定图G，输出从顶点v0到其余每个顶点的最短路径，要求输出各路径中的顶点信息。
-Map of the basic training algorithm 1 and the storage structure of the definition and plans to create the types of plans are: directed graph, undirected graph, to the network, no to the network. Map storage structure can be: adjacency matrix, the adjacent table. Requirements: adjacency matrix is given, respectively, and adjacent table in a certain kind of map creation algorithm 2, graph traversal: Non-recursive depth-first search algorithm, breadth-first search algorithm. 3, graph traversal depth of applications: for Undirected connected graph of the key points (teaching P177-178, Algorithm 7.10 and 7.11) 4, Fig traverse the breadth of applications: a given graph G, the output from the vertex v0 to The rest of each vertex of the shortest path, the path of the output requirements of the vertex information.
Platform: |
Size: 7168 |
Author: bueaty |
Hits:
Description: implement depth first algorithm
Platform: |
Size: 6144 |
Author: nandu |
Hits:
Description: 此代码为“图的深度优先遍历”的源代码，图的存储形式为邻接矩阵，里面有图的邻接矩阵存储的代码，有深度优先遍历的算法，还有验证的主函数。-This code for the " depth-first traversal map" of the source code, Figure storage form of adjacency matrix, there are plans stored in the adjacency matrix code, a deep traversal algorithm priority, as well as to verify the main function.
Platform: |
Size: 2048 |
Author: 熊龙龙 |
Hits:
« 12
3
4
5
6
7
8
9
10
...
50
»