Location:
Search - DFS matrix
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: 图可以采用邻接矩阵、邻接表等多种方式来存储，本程序实现图的邻接矩阵存储-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: 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: (1)自选存储结构，输入含n个顶点（用字符表示顶点名称）和e条边的图G；
(2)指定任意顶点x为初始顶点，对图G作DFS遍历，输出DFS（深度优先）顶点序列(提示:使用栈实现DFS)；
(3)指定任意顶点x为初始顶点，对图G作BFS（广度遍历），输出BFS顶点序列(提示:使用队列实现BFS)；
(5)输入顶点x，查找图G:若存在含x的顶点，则删除该结点及与之相关连的边，并作DFS遍历(执行操作3)；否则输出信息“不存在x”；
(6)判断图G是否是连通图，输出信息“YES”/“NO”；
(7)如果选用的存储结构是邻接矩阵，则用邻接矩阵的信息生成图G的邻接表-(1) on-demand storage structure, input containing n vertices (with characters in the name of that vertex) and e edges of the graph G
(2) specify arbitrary vertex x as the initial vertex of the graph G for the DFS traversal, output DFS (depth-first) vertex sequence (Hint: Use the stack to achieve DFS)
(3) specify arbitrary vertex x as the initial vertex of the graph G for the BFS (breadth traversal), the output sequence of BFS vertex (hint: the realization of the use of queue BFS)
(5) input vertex x, find graph G: If there is a vertex with x, then the deletion of the nodes and edges associated with them, and DFS traversal (3 steps) Otherwise output "does not exist x"
(6) to determine whether graph G is a connected graph, output "YES"/"NO"
(7) If I choose the storage structure is the adjacency matrix, the adjacency matrix of the information used to generate the adjacency list graph G
Platform: |
Size: 3072 |
Author: 涂舒 |
Hits:
Description: MatToList(MGraph g,ALGraph *&G)：将邻接矩阵g转换成邻接表G。
ListToMat(ALGraph *G,MGraph &g)：将邻接表G转换成邻接矩阵g。
DispMat(MGraph g)：输出邻接矩阵g。
DispAdj(ALGraph *G)：输出邻接表G。
DFS(ALGraph *G,int v)：以递归的方法从顶点v深度优先遍历图G。
DFS1(ALGraph *G,int v)：以非递归的方法从顶点v深度优先遍历图G。
BFS(ALGraph *G,int v)：从顶点v广度优先遍历图G。
- MatToList (MGraph g, ALGraph* & G): the adjacency matrix adjacency list g into G. ListToMat (ALGraph* G, MGraph & g): the adjacent table adjacency matrix G into g. DispMat (MGraph g): output adjacency matrix g. DispAdj (ALGraph* G): output adjacency list G. DFS (ALGraph* G, int v): to the method of recursive vertex v from the depth-first traversal graph G. DFS1 (ALGraph* G, int v): non-recursive method to vertex v from the depth-first traversal graph G. BFS (ALGraph* G, int v): vertex v from the breadth-first traversal graph G.
Platform: |
Size: 3072 |
Author: 小鬼 |
Hits:
Description: 包括了图的大部分基本算法，每一种算法都以邻接矩阵与邻接表两种形式给出，算法包括建图，图的遍历（如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.
Platform: |
Size: 244736 |
Author: seckCoder |
Hits:
Description: 用邻接矩阵法建一无向连通图（顶点信息为字符），分别用dfs（深度优先搜索）和bfs(广度优先搜索)遍历，输出图中顶点信息并验证。-Adjacency matrix to build an undirected connected graph (vertex information for characters), respectively dfs (depth-first search), and bfs (breadth-first search) traversal, the output graph vertex information and verification.
Platform: |
Size: 4096 |
Author: fanfausun |
Hits:
Description: 应用MATLAB的M文件编程方法过行信号频域分析。分别用矩阵运算的方法计算方波的DFS，在60的时窗宽度上方波宽度分别为5与12。并且画出x(n)和DFS(x(n))的杆状图。-Application of MATLAB M-file programming off-line signal frequency domain analysis. Were calculated using matrix calculation of square wave of DFS, in the 60' s when the window width the width of the top of wave 5 and 12, respectively. And draw the x (n) and DFS (x (n)) of the rod-shaped graph.
Platform: |
Size: 1024 |
Author: Wu Ying |
Hits:
Description: 7、 图论—连通性 56
7.1 无向图关键点(dfs邻接阵) 56
7.2 无向图关键边(dfs邻接阵) 57
7.3 无向图的块(bfs邻接阵) 58
7.4 无向图连通分支(dfs/bfs邻接阵) 59
7.5 有向图强连通分支(dfs/bfs邻接阵)60
7.6 有向图最小点基(邻接阵) 61-7, graph theory- Connectivity 56 7.1 free key points to the map (dfs adjacency matrix) 56 7.2 Key undirected graph edge (dfs adjacency matrix) 57 7.3 undirected graph of the block (bfs adjacency matrix) 58 7.4 The connected components of undirected graph (dfs/bfs adjacency matrix) 59 7.5 has to strengthen the country connected components (dfs/bfs adjacency matrix) 60 7.6 Minimum of directed graph-based (adjacency matrix) 61
Platform: |
Size: 446464 |
Author: 孔明 |
Hits:
Description: 设计一个有向图，建立图的邻接矩阵或邻接表的存储结构，完成有向图的DFS（深度优先遍历）和BFS（广度优先遍历）的操作-Design of a directed graph, the establishment of the adjacency matrix or adjacency list of the storage structure, complete directed graph DFS (depth-first traversal) and BFS (breadth-first traversal) operation
Platform: |
Size: 5120 |
Author: tang |
Hits:
Description: 对以邻接矩阵为存储结构的图进行 DFS和 BFS遍历.
-Adjacency matrix of the storage structure of the graph for the DFS and BFS traversals.
Platform: |
Size: 25600 |
Author: duliu |
Hits:
Description: DFS算法，我自己写的，主要用邻接矩阵存储图-DFS algorithm, I wrote it myself, the main memory map with the adjacency matrix
Platform: |
Size: 1024 |
Author: 还有梦想 |
Hits:
Description: 本源码实现了图的基本操作。BFS,DFS,邻接矩阵，邻接链表，矩阵变换，拓扑排序等。-This code is about Basic opereation of Graph.Such as BFS,DFS,adjacent-matrix/list matrixing and topical sort etc.
Platform: |
Size: 2048 |
Author: 人类 |
Hits:
Description: This code do depth first search algorithm. Adjacency matrix symbolize every edge in the graph, for example adj[i][j]=1 is an edge from i to j, i and j are vertices.
Platform: |
Size: 1024 |
Author: Dennis |
Hits:
Description: C语言，采用邻接矩阵存储，实现图的BFS、DFS遍历，源代码-C language, using the adjacency matrix storage Figure BFS and DFS traversal, and source code
Platform: |
Size: 1024 |
Author: Leo |
Hits:
Description: 1) 先任意创建一个图；
2) 图的DFS,BFS的递归和非递归算法的实现
3) 最小生成树（两个算法）的实现，求连通分量的实现
4) 要求用邻接矩阵、邻接表、十字链表多种结构存储实现-A) any first create a graph 2) DFS, BFS recursive and non recursive algorithm 3) The minimum spanning tree (algorithm) to achieve, find the connected components to achieve 4) request with adjacency matrix, adjacency list cross-linked lists a variety of structural storage implementation
Platform: |
Size: 4096 |
Author: liliaaa |
Hits:
Description: 用邻接矩阵表示的图的类型 DFS：深度优先遍历的递归算法BFS：广度优先遍历判断从顶点vi到顶点vj是否可达-Adjacency matrix type DFS: depth-first traversal of the recursive algorithm BFS: breadth-first traversal of the judgment from the vertex vi to vertex vj is reachable
Platform: |
Size: 2048 |
Author: 赫想 |
Hits:
Description: 邻接表存储图，然后进行深度优先遍历及广度优先遍历。-DFS,adjacent matrix
Platform: |
Size: 1024 |
Author: 申明和 |
Hits:
Description: 无向图的关键边,dfs邻接阵形式,O(n^2)-The critical edge of the undirected graph, dfs adjacency matrix form, O (n ^ 2)
Platform: |
Size: 1024 |
Author: 曹城生 |
Hits: