Search - dfs algorithm source

Search - dfs algorithm source - List

[Other resource] BFSandDFS DL : 0: 用C写的源程序功能分别是1.用DFS算法判断有向图中是否有环2.从文件中读图，用邻接链表保存信息，寻找两个结点vi,vj间的最短路径-written in C source is a function respectively. DFS algorithm used to determine whether there are plans Central 2. Interpret drawings from the file, use the adjacent Chain preservation of information to find two nodes vi, vj the shortest path
Date : 2008-10-13 Size : 3.02kb User : 光光
[Other resource] 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.
Date : 2008-10-13 Size : 2.91kb User : bo
[Data structs] BFSandDFS DL : 1: 用C写的源程序功能分别是1.用DFS算法判断有向图中是否有环2.从文件中读图，用邻接链表保存信息，寻找两个结点vi,vj间的最短路径-written in C source is a function respectively. DFS algorithm used to determine whether there are plans Central 2. Interpret drawings from the file, use the adjacent Chain preservation of information to find two nodes vi, vj the shortest path
Date : 2025-07-04 Size : 3kb User : 光光
[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.
Date : 2025-07-04 Size : 3kb User : bo
[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
Date : 2025-07-04 Size : 14kb User : oh204
[Data structs] DFS DL : 0: 数据结构的作业有关dfs算法程序源代码-Data structure operating on the dfs algorithm source code
Date : 2025-07-04 Size : 102kb User : 林瑶
[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
Date : 2025-07-04 Size : 15kb User : 海霞
[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
Date : 2025-07-04 Size : 860kb User : cuiyuzheng
[Data structs] basicoperationformap DL : 0: 包括了图的大部分基本算法，每一种算法都以邻接矩阵与邻接表两种形式给出，算法包括建图，图的遍历（如DFS和BFS），最小生成树，从某个源点到蓁各顶点的最短路径等-Includes most of the basic graph algorithms, each algorithm is to adjacency matrix and adjacency list is given in two forms, algorithms, including the construction of map, graph traversal (such as DFS and BFS), the minimum spanning tree, from a source point Zhen each vertex to the shortest path, etc.
Date : 2025-07-04 Size : 239kb User : seckCoder
[OpenGL program] maze3D DL : 0: Source Code OpenGL and Java (JOGL), for generate 3D maze (using DFS algorithm), and you can move a cursor in maze, using your mouse, to find a way out from maze.
Date : 2025-07-04 Size : 1.63mb User : sgt
[matlab] syndiastikhbeltistopoihshaskisi DL : 0: DFS CODE 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
Date : 2025-07-04 Size : 3kb User : Nikos
[Special Effects] ApplicationsOfDepth-FirstTraversal DL : 0: 1. 用ＤＦＳ判断一个无向图是否是连通图； 2. 为有向图的边分类，将它们的边分为前向边、后向边和交叉边； 3. 用ＤＦＳ和点消除求有向图的拓扑排序； 4. 判断有向图是不是强连通图，若不是，求强连通分量； 5. 判断有向图是不是半连同图； 6. 判断有向图是不是单连通图； 7. 判断无向图是不是双连通图。通过以上编程对ＤＦＳ的应用，进一步了解ＤＦＳ的算法及它所代表的算法思想。 -1. Using DFS to test if a given undirected graph is connected or not. 2. Classify the edges of a directed graph into tree edges, back edges, forward edges or cross edges by a depth-first traversal of the graph. If the given graph is undirected, classify the edges into tree edges and back edges. And verify if a directed or undirected graph has a cycle. 3. Compute the topological order of a directed graph using both DFS algorithm and source removal algorithm. 4. A strongly connected graph is a directed graph with every pair of vertices reachable from each other. A strongly connected component C of a directed graph G is a subset of maximal vertices such that every pair of vertices in the subset are reachable from each other. A strongly connected component graph GSCC of a graph G is a directed graph that each component C of G is considered as a single vertex in GSCC and there is an edge between components C1 and C2 if there exist an edge (u, v) in the graph G with u belongs to C1 and v
Date : 2025-07-04 Size : 10kb User : 卢竹江
[Data structs] 1979 DL : 0: 深度优先搜索（DFS）,此代码为自己写的POJ1979题的源代码。使用dfs算法简单水过。-Depth-first search (DFS), this code is to write their own POJ1979 title of the source code. Dfs algorithm is simple to use water too.
Date : 2025-07-04 Size : 1kb User : 胤明枫
[Data structs] DFS DL : 0: 数据结构经典算法，宽度优先遍历，c语言源代码。-Data structure classical algorithm, breadth-first traversal, c language source code.
Date : 2025-07-04 Size : 9kb User : shorkmoly
[Mathimatics-Numerical algorithms] future_net.tar DL : 0: 带约束的最短路径求解问题（深度搜索算法DFS）C语音源代码华为软件大赛-寻路-Solving the shortest path problem with constraints (depth search algorithm DFS) C source code for voice Huawei Software Competition- pathfinding
Date : 2025-07-04 Size : 15kb User : 崔琦
[matlab] DFS DL : 0: DFS算法源码，有需要的下载，够20个字了没，应该不够，这下够了-DFS algorithm source code, there is a need to download, 20 words enough yet, it should be enough, which is enough under
Date : 2025-07-04 Size : 1kb User : zms