Search - DFS

Search - DFS - List

【Windows Develop】 graphsearch(DFS) DL : 0: 根据深度优先搜索原理，用c++编程实现图的遍历，本程序源于对农夫和羊，狼以及蔬菜过河这一经典问题探究。-By c++ programing,we make DFS come ture! DFS means Depth First Search,it is a very impoint measure to reserch the graph.
Update : 2024-05-03 Size : 6144 Publisher : eric
【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.
Update : 2024-05-03 Size : 1704960 Publisher : 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
Update : 2024-05-03 Size : 3072 Publisher : Nikos
【Data structs】 graph DL : 0: 有向图采用邻接表存储 DFS和BFS方法遍历为方便表示,结点数小于10 用V0-V9表示不同的结点的-Directed graph using adjacency list method of storing DFS and BFS traversal for the convenience that the number of nodes is less than 10 with V0-V9 for different node
Update : 2024-05-03 Size : 2048 Publisher : 刘少东
【Mathimatics-Numerical algorithms】 BFS-DFS DL : 0: code in c for DFS AND BFS
Update : 2024-05-03 Size : 9216 Publisher : dief
【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
Update : 2024-05-03 Size : 10240 Publisher : 卢竹江
【Windows Develop】 main DL : 0: Dijkstra and DFS. It finds all the shortest ways from one point to all others. Then it counts all the ways which is always coming to the destiny.
Update : 2024-05-03 Size : 1024 Publisher : Gjou
【Algorithm】 DFS DL : 0: Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking.
Update : 2024-05-03 Size : 1024 Publisher : a32
【.net】 dfs DL : 0: this code for dfs in c-this code for dfs in c++
Update : 2024-05-03 Size : 1024 Publisher : Mypd
【Windows Develop】 dfs-bfs DL : 0: 简单的图的深度搜索和广度搜索，适合初学者交流-a simple example of DFS and BFS
Update : 2024-05-03 Size : 1024 Publisher : 林俊鹏
【Data structs】 DFS DL : 0: DFS算法，我自己写的，主要用邻接矩阵存储图-DFS algorithm, I wrote it myself, the main memory map with the adjacency matrix
Update : 2024-05-03 Size : 1024 Publisher : 还有梦想
【matlab】 DFS DL : 0: DFS判断两点间的连通性，即1与n间的连通性-DFS to determine the connectivity between two points, that is between 1 and n connectivity
Update : 2024-05-03 Size : 1024 Publisher : 阮渊鹏
【2D Graphic】 DFS-And-BFS-2D DL : 0: This is a project about BFS and DFS algorithm
Update : 2024-05-03 Size : 52224 Publisher : master_lam
【AI-NN-PR】 Machines-Based-on-DFS DL : 0: 深度优先搜索的支持向量机参数优化算法 Study on Parameters Optimization of Support Vector Machines Based on DFS :研究支持向量机参数优化问题，由于算法要求准确选择 SVM 参数，支持向量机在处理大样本数据集时和最优模型参数确定时，消耗的时间长、占有内存大，易获得局部最优解的难题。为了解决支持向量机存在的不足，采用深度优先搜索算法对其参数优化机机制进行改进。将向量机参数优化视成一个组合优化问题，将支持向量机模型的分类误差作为优化目标函数，采用深度优先算法对其进行求解，最后将模型应用于 3 个标准分类数据集。仿真结果表明，优化参数后的支持向量机加快模型的训练速度度，提高了分类的准确率，很好的解决- Study on the problems of support vector machines parameters optimization． The prediction precision of Support vector machines model and generalization ability depend on its parameters reasonable choice． The problems of time － consuming and easy falling into the local optimal value exist in traditional support vector machine parameters optimization algorithm，and support vector machine prediction precision is low． In order to solve the problems，the paper puts forward a method based on depth first search of SVM parameters optimization method ( DFS － SVM) ． DFS － SVM takes SVM parameters optimization as a combinatorial optimization problem and the RMSE as optimization goal，uses depth first search to select SVM parameters，and tests DFS － SVM performaces through three standard data set． Simulation experiment results show that the DFS － SVM prediction accuracy is improved and the training time is shorten greatly． It provides a new effective solution for SVM parameters optimizat
Update : 2024-05-03 Size : 259072 Publisher :
【Data structs】 DFS DL : 0: DFS作业，算法作业，c++ dfs算法作业-DFS homework
Update : 2024-05-03 Size : 913408 Publisher : DLH
【Windows Develop】 DFS DL : 0: DFS algorithm c++ code
Update : 2024-05-03 Size : 1024 Publisher : jebrail
【MPI】 DFS DL : 0: MPI implementation the DFS method
Update : 2024-05-03 Size : 1024 Publisher : clau
【matlab】 dfs(2) DL : 0: dfs algorithm in matlab
Update : 2024-05-03 Size : 2048 Publisher : msyranidi
【Data structs】 DFS DL : 0: DFS图的深度优先遍历！C++编写,数据结构-programing by c++
Update : 2024-05-03 Size : 8192 Publisher : 沈杰
【Data structs】 Bfs-Dfs DL : 0: 在C环境中使用Bfs，Dfs的遍历算法创建邻接表建立图。-C environment Bfs Dfs traversal algorithm to create an adjacency table to create the diagram.
Update : 2024-05-03 Size : 1024 Publisher : opsqcs

« 1 2 3 4 56 7 8 9 10 ... 25 »