Location:
Search - DFS graph
Search list
Description: 有向图从邻接矩阵转换为邻接表后再深度优先遍历-a graph from the adjacency matrix conversion of the adjacent#$#!142996#!#$read IntelCPU serial number. Rar!#$#read Intel CPU serial number. Rar read Intel CPU serial number. Read rar Intel CPU serial number. rar
Platform: |
Size: 1298 |
Author: 面包 |
Hits:
Description: 有向图从邻接矩阵转换为邻接表后再深度优先遍历-a graph from the adjacency matrix conversion of the adjacent#$#!142996#!#$read IntelCPU serial number. Rar!#$#read Intel CPU serial number. Rar read Intel CPU serial number. Read rar Intel CPU serial number. rar
Platform: |
Size: 1024 |
Author: 面包 |
Hits:
Description: 试扩充深度优先搜索算法，在遍历图的过程中建立生成森林的左子女-右兄弟链表。算法的首部为 void Graph::DFS ( const int v, int visited [ ], TreeNode<int> * t ) 其中，指针t指向生成森林上具有图顶点v信息的根结点。（提示：在继续按深度方向从根v的某一未访问过的邻接顶点w向下遍历之前，建立子女结点。但需要判断是作为根的第一个子女还是作为其子女的右兄弟链入生成树。）
-try to expand the depth-first search algorithm, the traverse of the process to establish the forest generation of children left-right List brothers. The first algorithm to void Graph : : DFS (const int v, int visited [], TreeNode
Platform: |
Size: 1024 |
Author: dfssd |
Hits:
Description: 图论中二种遍历图的算法.深度优先遍历,与广度优先遍历.-graph theory two species traverse map algorithm. Depth-first traversal, and the breadth- first traversal.
Platform: |
Size: 2048 |
Author: 张新 |
Hits:
Description: 求有向图的强连通分量，使用2次dfs的算法，具体名字我也忘掉了-Order to have a strongly connected directed graph component, the use of 2 dfs algorithm, the specific name I have forgotten
Platform: |
Size: 2048 |
Author: zzq |
Hits:
Description: 基本算法正稿
包括:一、数论算法；二、图论算法；三、背包问题；四、排序算法；五、高精度计算；六、 树的遍历；七 进制转换；八 全排列与组合的生成；九.查找算法；十、贪心；十一、回溯法框架；十二、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
Platform: |
Size: 14336 |
Author: oh204 |
Hits:
Description: 基本数据结构与STL
树及遍历
图的DFS与BFS
-Basic data structures and STL tree and graph traversal DFS and BFS
Platform: |
Size: 223232 |
Author: veryha |
Hits:
Description: 图可以采用邻接矩阵、邻接表等多种方式来存储，本程序实现图的邻接矩阵存储-Chart can be used adjacency matrix, adjacency lists to store a variety of ways, this program graph adjacency matrix storage
Platform: |
Size: 1024 |
Author: youjing |
Hits:
Description: 本程序采用深度优先的方法完成图的遍历，包括连通图和非连通图。-This procedure used the method of depth-first traversal of the complete diagram, including the connected graph and non-connected graph.
Platform: |
Size: 1024 |
Author: youjing |
Hits:
Description: 三个求二分图最大匹配的程序（bfs，dfs，多增光路算法）-Three for the maximum bipartite graph matching procedure (bfs, dfs, multi-path algorithm Zengguang)
Platform: |
Size: 1024 |
Author: liulanzheng |
Hits:
Description: 本文档容括了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
Platform: |
Size: 15360 |
Author: 海霞 |
Hits:
Description: DFS非递归函数
函数功能：图的dfs的非递归算法(用堆栈实现)
输入：图的邻接矩阵
输出：dfs序列
-DFS non-recursive function function function: dfs map non-recursive algorithm (using the stack to achieve) Input: adjacency matrix graph output: dfs sequence
Platform: |
Size: 1024 |
Author: sunshine |
Hits:
Description: 图的邻接表存储表示法 源码 这是进行计算机图论算法的基础 如最基本算法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
Platform: |
Size: 880640 |
Author: cuiyuzheng |
Hits:
Description: CREATE GRAPH WITH NEW TECHNOLOGY OF DRAWING
Platform: |
Size: 2048 |
Author: HABIL |
Hits:
Description: 图论编程，包含文件操作，建立图的邻接表，并实现深度优先搜索-Graph theory programming, including file operations, the establishment of plans of the adjacent table, and the depth-first search
Platform: |
Size: 6144 |
Author: |
Hits:
Description: BFS IMPLEMENT OF GRAPH
Platform: |
Size: 1024 |
Author: mithi |
Hits:
Description: 该压缩文件中包含了图论当中的一些重要算法，包括前序中序和后序遍历、最小二叉树、DFS、BFS以及拓扑排序。-The compressed file contains a graph theory among a number of important algorithms, including the former order in the order and postorder traversal, the smallest binary tree, DFS, BFS, and topological sort.
Platform: |
Size: 948224 |
Author: 许娜娜 |
Hits:
Description: 有向图 采用邻接表存储 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
Platform: |
Size: 2048 |
Author: 刘少东 |
Hits:
Description: Graph Theory
Coded by mostafa mirgouhar
Platform: |
Size: 3072 |
Author: mosi miri |
Hits:
Description: peymayesh dfs graph ba zaban c-peymayesh dfs graph ba zaban c++
Platform: |
Size: 563200 |
Author: sunboy |
Hits: