有向图转置
[英]Transpose of Directed Graph
问题描述
Can anyone tell me the efficient algorithm to calculate the transpose for Directed Graph for both Adjacency List and Adjacency Matrix Representations? 
谁能告诉我有效的算法，以计算邻接表和邻接矩阵表示的有向图的转置？ Also, the time complexity of both the algorithms. 同样，两种算法的时间复杂度。 Thanks in advance. 提前致谢。
1 个解决方案
解决方案1
0 2016-01-31 00:16:22
Iterate over all edges and reverse their direction. 遍历所有边缘并反转其方向。 O(V+E) time for adjacency list and O(V^2) time for adjacency matrix. 邻接表的O（V + E）时间和邻接矩阵的O（V ^ 2）时间。
声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.
相关问题
有向图的转置算法 - Transpose Algorithm for Directed Graphs
Graph - 有向图的平方 - Graph - Square of a directed graph
检查图是否是有向图？ - Check if Graph is a Directed Graph?
有向图分解 - Directed graph decomposition
有向图：欧拉路径 - Directed Graph: Euler Path
定向图连接 - Directed graph connectivity
有向图中的路径相似度 - Path Similarity in a Directed Graph
循环遍历有向图 - Traversal directed graph with cycles
循环有向图的遍历 - Traversal of cyclic directed graph
有向图是强连通的 - directed graph is strongly connected
相关标签