Location:
Search - breadth search
Search list
Description: Win32下的华容道游戏程序，含源代码和设计文档。
用户可以走棋，也可任意走棋状态自动求解，用广度搜索实现，判重使用平衡二叉树，欢迎交流-under Win32 Puzzle procedures, including the source code and design documents. Users can take advantage of chess, chess can take arbitrary automatic state solution with breadth search achieve sentenced to heavy use of the balanced binary tree. welcome exchanges
Platform: |
Size: 1289530 |
Author: enderlw |
Hits:
Description: 数据结构学习用到的一些程序！！里面有二叉树相关的几个，有深度，广度搜索，各种排序等！-data structure used to study some of the procedures. ! There are several related to the binary tree, the depth, breadth search, various ranking!
Platform: |
Size: 517348 |
Author: 郑兰军 |
Hits:
Description: win32sdk+智能算法
主要使用深度+广度搜索-win32sdk intelligent algorithm mainly use depth and breadth Search
Platform: |
Size: 37552 |
Author: yangzhenxing |
Hits:
Description: 人工智能中的广度搜索的九宫问题 用VC实现-breadth of artificial intelligence search JiuGongTu issue with VC
Platform: |
Size: 16384 |
Author: 楚方 |
Hits:
Description: 载入txt文件迷宫，含几种搜索方法，例如depth first search, breadth first search等-maze included txt file containing several search methods, such as depth first search, breadth first search, etc.
Platform: |
Size: 14336 |
Author: 黄丽雯 |
Hits:
Description: 提供了深度优先搜索,广度优先搜索,添加启发信息的最小代价搜索,查找多个解,查找最优解的范例程序.-a depth-first search, breadth- first search, add the information inspired the minimum price for a search of solutions to search, find out the optimal solution sample programs.
Platform: |
Size: 12288 |
Author: 陈宁 |
Hits:
Description: 图论中关于简单无向图的深度，广度搜索，由图形界面简单方便的演示。-on graph theory to a simple map with the breadth, depth search by the graphical interface is simple and convenient to the demonstration.
Platform: |
Size: 146432 |
Author: linus yue |
Hits:
Description: Win32下的华容道游戏程序，含源代码和设计文档。
用户可以走棋，也可任意走棋状态自动求解，用广度搜索实现，判重使用平衡二叉树，欢迎交流-under Win32 Puzzle procedures, including the source code and design documents. Users can take advantage of chess, chess can take arbitrary automatic state solution with breadth search achieve sentenced to heavy use of the balanced binary tree. welcome exchanges
Platform: |
Size: 1289216 |
Author: enderlw |
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: 数据结构学习用到的一些程序！！里面有二叉树相关的几个，有深度，广度搜索，各种排序等！-data structure used to study some of the procedures. ! There are several related to the binary tree, the depth, breadth search, various ranking!
Platform: |
Size: 6249472 |
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: win32sdk+智能算法
主要使用深度+广度搜索-win32sdk intelligent algorithm mainly use depth and breadth Search
Platform: |
Size: 811008 |
Author: yangzhenxing |
Hits:
Description: 用图形用户界面表示的图，数据结构基本应用，最小生成树算法，最短路径，广度、深度优先搜索-graphical user interface with the plan said, the basic data structure application, the minimum spanning tree algorithm, the shortest path, breadth, depth-first search
Platform: |
Size: 61440 |
Author: 张旭 |
Hits:
Description: 二叉树的遍历、线索化、遍历线索化二叉树等算法；深度搜索优先、广度搜索优先算法，
最小生成树、最短路算法。-Binary tree traversal, threaded, threaded binary tree traversal algorithms, such as the depth of the search priority, breadth of search priority algorithm, minimum spanning tree, shortest path algorithm.
Platform: |
Size: 314368 |
Author: 刘飞 |
Hits:
Description: 輕易學好C++編程技巧 - 進楷 (香港科技大學筆記 19課) 內容包括
1) base C++ review,
2) Pointers and Dynamic Objects,
3) Recursion,Linked Lists,
4) Stacks and Queues,
5) Algorithm Analysis,
6) Insertion Sort and Mergesort,
7) Quicksort,
8) Heaps and Heapsort,
9) Lower Bound of Sorting and Radix Sort,
10) Binary Trees and Binary Search Trees
11) AVL Trees,
12) B+ Trees
13) Graphs and Breadth-First Search
14) Depth-First Search
15) Connected Components, Directed Graphs,
16) Topological Sort
17) Hashing
18) Pattern Matching
19) Additional Review
-Easily learn C++ Programming skills- Jin Kai (Hong Kong University of Science and Technology Division notes 19) will include 1) base C++ Review, 2) Pointers and Dynamic Objects, 3) Recursion, Linked Lists, 4) Stacks and Queues , 5) Algorithm Analysis, 6) Insertion Sort and Mergesort, 7) Quicksort, 8) Heaps and Heapsort, 9) Lower Bound of Sorting and Radix Sort, 10) Binary Trees and Binary Search Trees 11) AVL Trees, 12) B+ Trees 13) Graphs and Breadth-First Search 14) Depth-First Search 15) Connected Components, Directed Graphs, 16) Topological Sort 17) Hashing18) Pattern Matching 19) Additional Review
Platform: |
Size: 3751936 |
Author: chan kindfish |
Hits:
Description: 本程序采用 blind breadth search解eight puzzles问题, 且消除了重复的布局。-This procedure blind breadth search solution using eight puzzles problems, as well as the elimination of duplicate layout.
Platform: |
Size: 9216 |
Author: chen yong |
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: this code contains breadth first search and array
Platform: |
Size: 18432 |
Author: wayil |
Hits:
Description: 用CUDA实现BFS算法源码。CUDA是NV公司基于GPU的统一计算架构，BFS复杂度由CPU上的O(V+E)降为O(diameter)，直径diameter即图中root到leaf的最长距离。-This is the algorithm of BFS(breadth first search) on CUDA, and its time complexity is down to O(diameter) which diameter means the longest distance between the root and the leaves.
Platform: |
Size: 1024 |
Author: iJuliet |
Hits:
Description: 2． 设计一个程序，实现文件查找。文件查找操作是一项非常基本的操作，一般的文件查找操作采用递归算法，实际上是采用“深度优先”的策略。请设计一个基于“广度优先”算法的文件查找程序。
提示：由于要找的文件往往距离待查文件夹最近的文件加中。因此，基于“广度优先”算法的文件查找的效率会优于“深度优先”算法。可以将待搜索的文件夹放入一个队列，然后列出该文件夹下所有成员：如果是文件，则与查找条件进行匹配；如果是文件夹，则将其放入队列。在次从队列头取文件夹，执行同样逻辑，直到队列为空。
- Design a program, implementation file search. File search operation is a very basic operating, general file search operation recursively algorithm, is actually use "depth-first" strategy. Please design a based on "breadth first search program files" algorithm.
Platform: |
Size: 1024 |
Author: guang |
Hits:
« 12
3
4
5
6
7
8
9
10
...
22
»