Search - bfs

Search - bfs - List

【Data structs】 Connect-Set DL : 0: 网易云课堂-陈越、何钦铭-数据结构-2016春 PTA-06-图1 列出连通集给定一个有NNN个顶点和EEE条边的无向图，请用DFS和BFS分别列出其所有的连通集。假设顶点从0到N− 1N-1N− 1编号。进行搜索时，假设我们总是从编号最小的顶点出发，按编号递增的顺序访问邻接点。-Given a free E N vertices and edges of the graph, please list the set of all of its communication with the DFS and BFS. Assume that the vertices 0 to N-1N-1N-1 number. When you search, we always assume the smallest number of vertices in ascending numerical order adjacent access points.
Update : 2024-05-17 Size : 1024 Publisher : zhangzhi
【ADO-ODBC】 ACM DL : 0: ACM练习题 zju1024 zju1940 zju2097 pku2503toj2196 zju1091 zju1507 zju1649 graph bfs-ACM exercises zju1024 zju1940 zju2097 pku2503 toj2196 zju1091 zju1507 zju1649
Update : 2024-05-17 Size : 7168 Publisher : che0osn
【Data structs】 BFS_graph DL : 0: 这是数据结构中图的广度优先算法的实现。广度优先算法是按照每个节点的拥有的孩子数目来进行遍历的。而不像图的深度优先算法是按照深层次，然后如果不能继续进入更深一层，就往回遍历。-BFS program of tree have a large of difference of the DFS program of trees.The produre of it is with the method of the children of a point ,rather than the depth of a point
Update : 2024-05-17 Size : 10240 Publisher : 冯严
【Algorithm】 oop-Week9 DL : 0: 关于布线问题的一些代码,包括BFS 过程和回溯过程-Some code on wiring problems, including the BFS process and backtracking process
Update : 2024-05-17 Size : 60416 Publisher : lll
【ADO-ODBC】 ACM DL : 0: ACM练习题 zju1024 zju1940 zju2097 pku2503toj2196 zju1091 zju1507 zju1649 graph bfs-ACM exercises zju1024 zju1940 zju2097 pku2503 toj2196 zju1091 zju1507 zju1649
Update : 2024-05-17 Size : 8192 Publisher : uxianlura9
【AI-NN-PR】 N-queens-algorithm DL : 0: n皇后问题的BFS算法，算法简洁，作为初学者一看就懂，不过先看会BFS算法很重要，这比普通的动态规划速度要快很多-N queens problem BFS algorithm, the algorithm is simple, as a beginner to understand, but first look at the BFS algorithm is very important, which is much faster than the general dynamic planning
Update : 2024-05-17 Size : 12288 Publisher : 黑所
【matlab】 bfs DL : 0: backward forward sweep power flow analaysis
Update : 2024-05-17 Size : 2048 Publisher : alireza
【Data structs】 sousuosuanfa DL : 0: 搜索算法. 实现基于树的基本搜索算法(BFS)的哈密顿环. 实现基于树的基本搜索算法(DFS)的哈密顿环. 实现基于爬山法的的哈密顿环. 利用分支界限算法实现最小哈密顿环. -Search algorithm. To achieve the basic algorithm tree search (BFS) Hamiltonian ring. Implement basic search algorithm (DFS) based on tree ring Hamiltonian. Based on climbing method Hamiltonian ring. Branch and Bound Algorithm utilizing minimal Hamiltonian ring.
Update : 2024-05-17 Size : 3072 Publisher : 大酱
【Software Engineering】 Test DL : 0: 最短路中的广度优先搜索，Dijkstra算法。网络算路问题的更优算法实现对于网络资源高效配置具有重要价值。题目是：给定一个带权重的有向图 G (V,E)，V 为顶点集，E 为有向边集，每一条有向边均有一个权重。对于给定的顶点 s、t，以及 V 的子集 V ，寻找从 s 到 t 的不成环有向路径 P，使得 P 经过 V 中所有的顶点(对经过 V 中节点的顺序不做要求)。若不存在这样的有向路径 P，则输出无解，程序运行时间越短，则视为结果越优；若存在这样的有向路径 P，则输出所得到的路径，路径的权重越小，则视为结果越优，在输出路径权重一样的前提下，程序运行时间越短，则视为结果越优。-Shortest in the BFS, Dijkstra algorithm. Better network algorithm calculates a path for network problems to achieve efficient allocation of resources of great value. Title is: Given a weighted directed graph G (V, E), V is the set of vertices, E is set to have the edge, each side has to have a weight. For a given vertex s, t, and V subset V , looking s to t acyclic directed path P, such that P through V in all vertices (elapsed V nodes in order not to Claim). If there is a directed path P, the output is no solution, the shorter the time the program runs, the more the result is considered excellent if there is a directed path P, the resulting output path, the path of the right weight is smaller, it is considered more excellent results in the output path weight the same premise, the shorter the time the program runs, the more the result is considered excellent.
Update : 2024-05-17 Size : 21504 Publisher : wangwanwan
【CSharp】 4 DL : 0: 有关于图的最短路径算法，常用的Dijkstra和SPFA算法或可采用堆优化或可采用A*算法加速实现时间复杂度的大幅降低。但是本题中图的边长均为1，使用BFS的时间复杂度较Dijkstra和SPFA有更为明显的降低，尽管看上去BFS更为简单-Figure about the shortest path algorithm, commonly used Dijkstra algorithm and SPFA or heap can be used to optimize or A* algorithm to accelerate dramatically reduce the time complexity. However, this problem in the long side of the figure is 1, using BFS time complexity compared with Dijkstra and SPFA have a more significant reduction, even though it looked easier to BFS
Update : 2024-05-17 Size : 524288 Publisher : LiNianjie
【Other】 bfs DL : 0: 程序的输入是图的顶点序列和边序列(顶点序列以*为结束标志，边序列以-1,-1为结束标志)。程序的输出为图的邻接表和广度优先遍历序列。-Input to the program is a sequence of vertices and edges of a sequence diagram (sequence of vertices with* marks the end edge sequence-1,-1 for the end marker). The output of the program to the adjacent table and graph breadth-first traversal sequence.
Update : 2024-05-17 Size : 1024 Publisher : 卡卡
【source in ebook】 graph DL : 0: 数据结构-图的操作 1.图的建立 2.图的深搜 3.图的广搜 4.最短路-(1).print the graph. (2).print the sequence of vertex names getting Depth-First Search. (3). print the sequence of vertex names getting Breadth-First Search. Dfs Bfs dijkstra
Update : 2024-05-17 Size : 2077696 Publisher : 林冬慧
【Data structs】 graph_lin DL : 0: 数据结构以及算法实现图的创建深搜、广搜、最短路-(1).print the graph. (2).print the sequence of vertex names getting Depth-First Search. (3). print the sequence of vertex names getting Breadth-First Search. Dfs Bfs dijkstra
Update : 2024-05-17 Size : 2077696 Publisher : 林冬慧
【Other】 BFS DL : 0: 广度优先遍历是以层为顺序，将某一层上的所有节点都搜索到了之后才向下一层搜索。-Breadth first traversal is based on the order of the layer, will be a layer of all the nodes are searched to the next layer after the search.
Update : 2024-05-17 Size : 1135616 Publisher : UnKnown
【Data structs】 a201702123 DL : 0: 星寻路算法真是我一生接触的第一个人工智能算法了。。。 A星寻路算法显然是用来寻路的，应用也很普遍，比如梦幻西游。。。算法的思路很简单，就是在bfs的基础上加了估值函数。它的核心是 F(x) G(x) + H(x) 和open、close列表： G(x)表示从起点到X点的消耗（或者叫移动量什么的），H(X)表示X点到终点的消耗的估值，F(x)就是两者的和值。open列表记录了可能要走的区域，close列表记录了不会再考虑的区域。我们每次都选F值最小的区域搜索，就能搜到一条到终点的最短路径，其中估值H越接近准确值，需要搜索的节点就越少。-wo bi jiao liaojie ,zhe2ge
Update : 2024-05-17 Size : 3072 Publisher : 王近两
【Other】 main DL : 0: SAP算法:求最大流有一种经典的算法，就是每次找增广路时用BFS找，保证找到的增广路是弧数最少的，也就是所谓的Edmonds-Karp算法。- SAP algorithm for the maximum flow is a classical algorithm, is each for augmenting path with BFS can guarantee the augmented way to find the minimum number of arcs, which is also called the Edmonds-Karp algorithm.
Update : 2024-05-17 Size : 1024 Publisher : 亮建
【CSharp】 8puzzles DL : 0: sovling 8puzzles (eight puzzles) problem with IDS and BFS methods in c#. inputs starts 0 to 8.-sovling 8puzzles (eight puzzles) problem with IDS and BFS methods in c#. inputs starts 0 to 8.
Update : 2024-05-17 Size : 89088 Publisher : hemmat
【Windows Develop】 BFS DL : 0: good example for student
Update : 2024-05-17 Size : 208896 Publisher : doxuandinh9501
【Algorithm】 the code DL : 0: 泊松分酒问题的一般解用BFS进行广度优先搜索实现简单(The general solution of Poisson's wine problem is implemented by BFS, which is simple in breadth first search)
Update : 2024-05-17 Size : 1024 Publisher : eeew
【Special Effects】 ex3 DL : 0: code for breadth first search - bfs
Update : 2024-05-17 Size : 1024 Publisher : sandeep2103

« 1 2 ... 14 15 16 17 18 1920 »