Search - bfs

Search - bfs - List

【GIS program】 search_short_path DL : 0: 采用A*算法完成地图路径规划功能,返回得到最短路径,实际效果优于BFS，DFS等算法。-A* algorithm using maps path planning function returns the shortest path, the actual effects are superior to BFS, algorithms such as DFS.
Update : 2024-05-02 Size : 7168 Publisher : xiaofeng
【OpenGL program】 test_1_DFS_BFS DL : 0: 比较DFS与BFS 简单的实现了，小地图范围的两种寻路算法原理的比较。左键控制，可自动寻找路径，方便观察-DFS compared with the simple realization of BFS, the small scope of the two map routing algorithms for comparison. Left control that can automatically find a path to facilitate the observation
Update : 2024-05-02 Size : 29696 Publisher : 阿申
【AI-NN-PR】 AIbashuma DL : 0: 我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个"扩展数组[4]"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient memory, using heuristic search, heuristic function f (x) = g (x) h (x) g (x) for the target node is different from the number of nodes, h (x) for the nodes of depth, the choice between f (x) nodes that the smallest node expansion. the introduction of an "expanded array [4]" (because the expansion of the nodes at most four), The array maintains a node of 0:00 a.m. to expand in all directions in the target node, and then expanded array analysis, use heuristic function during recursive expansion ...
Update : 2024-05-02 Size : 5120 Publisher : 丁如敏
【AI-NN-PR】 AIbashumaJava1 DL : 0: 我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个"扩展数组[4]"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient memory, using heuristic search, heuristic function f (x) = g (x) h (x) g (x) for the target node is different from the number of nodes, h (x) for the nodes of depth, the choice between f (x) nodes that the smallest node expansion. the introduction of an "expanded array [4]" (because the expansion of the nodes at most four), The array maintains a node of 0:00 a.m. to expand in all directions in the target node, and then expanded array analysis, use heuristic function during recursive expansion ...
Update : 2024-05-02 Size : 10240 Publisher : 丁如敏
【Data structs】 BFS11223 DL : 0: 该程序实现了无向图的建立和广度优先搜索及输出-the program no plans to the establishment and BFS and output
Update : 2024-05-02 Size : 168960 Publisher : 王并
【AI-NN-PR】 BFS_DFS_Astar DL : 0: 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.
Update : 2024-05-02 Size : 3072 Publisher : bo
【JSP/Java】 BFSFileSearch DL : 0: 这是一个基于BFS文件搜索的java代码-This is a document based on the BFS search java code
Update : 2024-05-02 Size : 1024 Publisher : tdh
【Data structs】 wide_search DL : 0: 广度优先搜索 c语言实现-BFS c Language
Update : 2024-05-02 Size : 4096 Publisher : 崔恒
【Other】 tu DL : 0: [输入] 图的顶点个数N，图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径，则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法，从顶点A开始，依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B，则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M，再访问与VA2邻接顶点...，如此下去，直至找到B，最先到达B点的路径，一定是边数最少的路径。实现时采用队列记录被访问过的顶点。每次访问与队头顶点相邻接的顶点，然后将队头顶点从队列中删去。若队空，则说明到不存在通路。在访问顶点过程中，每次把当前顶点的序号作为与其邻接的未访问的顶点的前驱顶点记录下来，以便输出时回溯。 #include<stdio.h> int number //队列类型 typedef struct{ int q[20] -[imported] map of the number of vertices N, Vertex map of the relationship between the starting point and end point A and B [output] if A to B without path then exporting "There is no path" Otherwise output A to B on the path vertices [storage structure] plan adopted adjacency matrix of storage. [Algorithm for the basic idea] BFS way from the vertex A, A visit followed with adjacent vertices VA1, VA2 ,..., VAK, visiting times, if not visit B, continue to visit with the VA1 adjacent vertices VA11, VA12 ,..., VA1M. VA2 and then visit the adjacent vertices ... and so on until finding B, the first to reach point B path, must be at least a few side paths. Queue used to achieve record was visited by the vertex. Each visit with the team atop the points are adjacent to the vertex, then t
Update : 2024-05-02 Size : 10240 Publisher : Demonic
【Data structs】 1136 DL : 0: zoj 1136题。 BFS搜索+同余求解-zoj 1136 title. BFS search+ Congruence Solving
Update : 2024-05-02 Size : 1024 Publisher : wzc
【Documents】 basicAlgorithm(pascal) DL : 0: 基本算法正稿包括:一、数论算法；二、图论算法；三、背包问题；四、排序算法；五、高精度计算；六、树的遍历；七进制转换；八全排列与组合的生成；九.查找算法；十、贪心；十一、回溯法框架；十二、DFS框架；十三、BFS框架；十五、数据结构相关算法 -Following is the basic algorithm include: number theory algorithm Second, graph theory algorithm III knapsack problem four, sorting algorithm five, high-precision calculation six, tree traversal seven hexadecimal conversion eight wide array and combination generation 9. Search algorithm 10, greed 11, backtracking framework 12, DFS framework 13, BFS framework 15, data structure-correlation algorithm
Update : 2024-05-02 Size : 14336 Publisher : oh204
【Shell api】 findFile DL : 0: 文件搜索程序在windows环境下根据键入的目录进行文件搜索,包括子目录在内进行递归遍历.使用了BFS算法.-File search process in the windows environment directory under the file type search, including subdirectories, to perform recursive traversal. The use of the BFS algorithm.
Update : 2024-05-02 Size : 2048 Publisher : xiao fei
【Data structs】 18BFS DL : 0: VC++实现广度优先遍历，BFS算法，属于数据结构习题-VC++ Achieve breadth-first traversal, BFS algorithms, data structures belonging to Exercises
Update : 2024-05-02 Size : 162816 Publisher : 张婷
【Data structs】 PathFinder DL : 0: 两种AstarPathFinder 一种DijkstraPathfinder BFS，DFS等相关寻路代码总结带地图随机生成和记时器-AstarPathFinder a two DijkstraPathfinderBFS, DFS and other related routing code summed up with randomly generated maps and timer
Update : 2024-05-02 Size : 69632 Publisher : JC
【Data structs】 new_search DL : 0: 基本数据结构与STL 树及遍历图的DFS与BFS -Basic data structures and STL tree and graph traversal DFS and BFS
Update : 2024-05-02 Size : 223232 Publisher : veryha
【Mathimatics-Numerical algorithms】 RBTree DL : 0: bfs是宽度遍历，在acm中占着很大的作用，这份课件包含了大部分内容-BFS is the width of ergodicity, in the acm plays a significant role in, the software contains most of the contents of
Update : 2024-05-02 Size : 89088 Publisher : 阿宝
【AI-NN-PR】 two_directon_BFS DL : 0: 双向BFS搜索算法，是针对acm.hdu.edu.cn上1401题所实现的代码，效率非常高。-Bi-directional BFS search algorithm is acm.hdu.edu.cn on the 1401 title by the realization of the code is highly efficient.
Update : 2024-05-02 Size : 1024 Publisher : sinamaster
【Data structs】 main DL : 0: 八皇后问题解法,包括DFS,BFS和INF三种解法-8 Queen
Update : 2024-05-02 Size : 2048 Publisher : fangming
【Data structs】 C DL : 0: 本文档容括了C（C＋＋）所有算法，分为数值算法、图论算法、背包算法、排序算法、高精度算法、树的遍历、进制转换、全排列和组合生成、查找算法、贪心、回溯法框架、DFS框架、BFS框架、数据结构相关算法。并有实例源码-This document, including the capacity C (C ) for all algorithms, divided into numerical algorithms, graph theory, algorithm, knapsack algorithm, sorting algorithm, high-precision algorithms, tree traversal, binary conversion, the whole arrangement and combination of generation, search algorithm, greedy , backtracking framework, DFS framework, BFS framework, data structure-correlation algorithm. And examples of source
Update : 2024-05-02 Size : 15360 Publisher : 海霞
【Windows Develop】 graph DL : 0: 图的邻接表存储表示法源码这是进行计算机图论算法的基础如最基本算法DFS BFS 图的邻接表存储表示法源码这是进行计算机图论算法的基础如最基本算法DFS BFS-Adjacency list graph representation of source storage This is a computer algorithm based on graph theory such as the basic algorithm DFS BFS graph adjacency list representation storage source This is a computer algorithm based on graph theory such as the basic algorithm DFS BFS
Update : 2024-05-02 Size : 880640 Publisher : cuiyuzheng

« 1 23 4 5 6 7 8 9 10 ... 20 »