在有向非循环图中查找层次树的算法？
[英]Algorithm to find a hierarchy tree in a directed acyclic graph?
问题描述
I have a graph with properties as shown below: 
我有一个属性图，如下所示：
Adjacency Matrix: 邻接矩阵：
Graph Representation: 图形表示：
Which algorithm can be applied to find a hierarchy tree of the above graph? 可以应用哪种算法来查找上图的层次树？ In my words, a hierarchy tree is one in which nodes are connected and directed towards their immediate child only and any edge from current to child of child or any other should be removed. 在我看来，层次结构树是指节点连接并仅指向其直接子节点的树，并且应该删除从子节点到子节点或任何其他节点的任何边缘。
For the above graph, a hierarchy tree would look like the following: 对于上图，层次结构树将如下所示：
Hierarchy Tree: 层次结构树：
1 个解决方案
解决方案1
6 已采纳 2013-09-27 10:08:59
I think Transitive Reduction is what you're looking for. 我认为Transitive Reduction是您正在寻找的。 Check this one : https://cs.stackexchange.com/questions/7096/transitive-reduction-of-dag 检查一下： https ： //cs.stackexchange.com/questions/7096/transitive-reduction-of-dag
声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.