Search - bfs

Search - bfs - List

【Other resource】图论 DL : 0: BFS、DFS、有向图、无向图中的各种算法的实现，可以自动生成图形。-BFS, DFS, to the map, no map to the realization of the algorithm can be automatically generated graphics.
Update : 2008-10-13 Size : 120088 Publisher : 李想
【Other resource】 Eidffakght DL : 0: 利用BFS算法解八数码问题在3*3的方格上放着1-8数码，有一空格为0变化规则为空格可以和上，下，右，左四个相邻的数字互换，至到和目标状态相等，每一种状态用一个结点表示而每个结点每次变化最多有四种结点，将这些结点依次入队列中，例如初始结点S0,入队列后出队，将S0变化最多产生的四种结点S01,S02,S03,S04依次入队列中，当S01出队后，产生的四种结点S11，S12，S13，S14(实际上不会有四种结点)依次入队，每次出队时与结束结点相比较，如果相等则退出，为了，防止已经入队的结点再次入队，(这样会造成列循环),将每次入队的结点设置一个标识号，四种变化即:向上，向下，向右，向左，我们要求向上和向下互斥，向右和向左互斥-use BFS Algorithm for eight in digital 3 * 3, the box copy digital 1-8, 0 for a change in spacing rules for space and can, under the right, left four adjacent digital exchange, and to target state of the same, each state with a node and each said nodes changes each have up to four nodes, and these nodes will be followed into the queue, for example, the initial node S0, out into the queue after the teams will have the most S0 changes of the four nodes S01, S02, SO3, S04-followed cohort, when S01 out teams after the four nodes S11 , S12, S13, S14 (not, in fact, four nodes), followed by the team, each team up with the end node comparison, if the same were to withdraw from, in order to prevent the team has the guitar again joined the team, (this will lead out cycle), each of the team set up a
Update : 2008-10-13 Size : 13589 Publisher : 刘少人
【Other resource】多变量寻优 DL : 0: 多变量寻优的源码，包括基本算法如下：DFP法（又称变尺度法），BFS法、一阶梯度法，共扼梯度法。-multivariate optimization of the source code, including basic algorithm is as follows : DFP Act (also known as the variable scale), BFS, a ladder degrees, a total of the accused gradient method.
Update : 2008-10-13 Size : 4664 Publisher : 陈镇静
【JSP/Java】九宫问题（八数）码分析 DL : 0: 九宫问题（八数码）的一个小软件，实现了多个程序的通讯解题和一套用BFS，双端BFS，A*搜索的分析程序。 rar中含一篇解题报告、软件、及netbeans源码。环境是JDK1.5_6-JiuGongTu (Digital 8), a small software Implementation of a number of procedures and a set of communication to solve problems with BFS, double-BFS, A * search of analytical procedures. Rar Solution containing a report, software, and Netbeans source. The environment is JDK1.5_6
Update : 2008-10-13 Size : 1236046 Publisher : wind
【Other resource】 prayer DL : 0: 野人传教士问题的一种简单实现方法，用的是标准模板库实现的BFS-Savage missionaries of a simple method, using the standard template library of the BFS
Update : 2008-10-13 Size : 1165 Publisher : 吴地瓜
【Other resource】 search_short_path DL : 1: 采用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 : 2008-10-13 Size : 7088 Publisher : xiaofeng
【AI-NN-PR】 BFS DL : 0: java环境下采用广度优先搜索来求解8-puzzle、8-queen等智能问题 -By using BFS java environment to solve the 8-puzzle, 8-queen, intelligent problem
Update : 2024-05-02 Size : 18432 Publisher : 夏益志
【Other】 bfs-in-sokoban DL : 0: bfs in sokaban game for AI project
Update : 2024-05-02 Size : 1141760 Publisher : bita
【Graph program】 bfs.tar DL : 0: cuda code of bfs algorithm
Update : 2024-05-02 Size : 25302016 Publisher : mina
【Data structs】 BFS DL : 0: 递归版本的广度优先算法的c++实现,包含邻接表存储有向图的类和测试程序。-c++ version of BFS .
Update : 2024-05-02 Size : 1024 Publisher : nqh
【Other Databases】 BFS-algorithm DL : 0: BFS算法，广度优先遍历算法。以邻接表为存储结构的广度优先遍历-BFS algorithm, breadth-first traversal algorithm. Table adjacent to the storage structure of the breadth-first traversal
Update : 2024-05-02 Size : 1027072 Publisher : 吴大
【Other】 BFS DL : 0: code of BFS algorithm for graph search
Update : 2024-05-02 Size : 1024 Publisher : hamideh
【Other】 dfs-bfs-master DL : 0: dfs-bfs-master 网上找到的 dfs和bfs演示- dfs-bfs-master found online dfs and bfs Demo
Update : 2024-05-02 Size : 3478528 Publisher : q
【Software Engineering】 BFS-ADJ-LIST-MAZE DL : 0: Breadth-first search (BFS) using adjacency matrix
Update : 2024-05-02 Size : 1024 Publisher : kim
【matlab】 BFS-algorithm-matlab DL : 0: 前推回代算法matlab代码，在计算电力系统无功优化时使用的算法，很实用的-BFS algorithm matlab code, used in reactive power optimization of power system is a very practical algorithm.
Update : 2024-05-02 Size : 3072 Publisher : 丁顺良
【Data structs】 BFS-algorithm-learning DL : 0: BFS经典算法，准备比赛时自己写的，一看即懂。里面有比较详细的算法介绍，可供学习参考。-BFS classic algorithm, ready to play when they write, a look that is to understand. There are more detailed algorithm introduced, available for study and reference.
Update : 2024-05-02 Size : 265216 Publisher : 黑所
【matlab】 BFS&DFS DL : 0: 广度优先搜索是从某一节点开始，搜索与其线连接的所有节点，按照广度方向像外扩展，直到不重复遍历所有节点。深度优先搜索是从某一节点开始，沿着其搜索到的第一个节点不断深入下去，当无法再深入的时候，回溯节点，然后再在回溯中的某一节点开始沿另一个方向深度搜索，直到不重复的遍历所有节点。(Breadth first search begins with a node and searches all nodes connected to its line, extending in the direction of the range as far as possible, until all nodes are not repeated. Depth first search is started from a node, the first node along its search to further down, when not further backtracking node, then a node in the back in the other direction to start the search depth, until not repeated traversal of all nodes.)
Update : 2024-05-02 Size : 1024 Publisher : Maxxxxx
【Windows Develop】 DFS BFS 图 DL : 0: 深度优先遍历和广度优先遍历算法实现从定点开始的遍历序列。(Depth first traversal and breadth first traversal algorithm to achieve the starting point from the traversal sequence)
Update : 2024-05-02 Size : 7168 Publisher : nativefaith
【Mathimatics-Numerical algorithms】 bfs1 DL : 0: bfs floodfill Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a 'search key') and explores the neighbor nodes first, before moving to the next level neighbours.
Update : 2024-05-02 Size : 2048 Publisher : kadekdwi
【Data structs】 N-Queue_DFS DL : 0: BFS法求解N皇后问题，输出全部解决方案。(BFS method for solving N queens problem and output all solutions.)
Update : 2024-05-02 Size : 32768 Publisher : 急速蜗牛

« 1 2 3 4 5 67 8 9 10 11 ... 20 »