DAG(有向无环图) ------应用
2013-05-30 08:51
309 查看
DAG是tree的泛化,也是ploy tree的泛化
In graph theory, polytree is a name for an oriented tree; that is, a polytree is a directed graph formed by giving a direction to each edge of a tree, forming an orientation of the tree. In other words, it
is a directed graph with exactly one directed path between any two vertices; equivalently, it is a directed acyclic graph (DAG) for which there are no undirected cycles and for which the underlying undirected graph is connected.
tree 是层次化,永远的细分,直到不能再分,DAG
从源开始细分,但是中间可以有合,有汇总。D就是可以合的点
上图是polytree
还不是通用的DAG
DAG 在编译里用来基本块优化,重写序列排序时用,但是两个节点之间可以有同向的两条有向边
操作系统中,多个进程之间的资源分配图为DAG,则多个进程是安全的
模型检测中,DAG存在有效的检测算法
In graph theory, polytree is a name for an oriented tree; that is, a polytree is a directed graph formed by giving a direction to each edge of a tree, forming an orientation of the tree. In other words, it
is a directed graph with exactly one directed path between any two vertices; equivalently, it is a directed acyclic graph (DAG) for which there are no undirected cycles and for which the underlying undirected graph is connected.
tree 是层次化,永远的细分,直到不能再分,DAG
从源开始细分,但是中间可以有合,有汇总。D就是可以合的点
上图是polytree
还不是通用的DAG
DAG 在编译里用来基本块优化,重写序列排序时用,但是两个节点之间可以有同向的两条有向边
操作系统中,多个进程之间的资源分配图为DAG,则多个进程是安全的
模型检测中,DAG存在有效的检测算法
相关文章推荐
- 有向无环图的应用—AOV网 和 拓扑排序
- Python 随机生成DAG(有向无环图)
- 有向无环图(DAG)的最小路径覆盖
- 有向无环图(DAG)拓扑排序的两种方法
- 有向无环图(DAG)的最小路径覆盖
- 动态规划--DAG(有向无环图)问题
- 有向无环图(DAG)的最小路径覆盖
- 有向无环图(DAG)的最小路径覆盖
- 有向无环图(DAG)的最小路径覆盖
- 数据结构(20)--DAG应用之AOE网的关键路径
- 【JavaScript】DAG(有向无环图),以及相关的JS库
- 有向无环图及其应用(拓扑排序)
- 有向无环图的应用-拓扑排序算法及实现 3ff0
- 有向无环图及其在汉语分词中的应用
- 有向无环图(DAG)拓扑排序的两种方法
- 有向无环图(DAG)的所有拓扑序列
- 有向无环图的讨论应用
- 有向无环图及其应用、拓扑排序
- 47. 数据结构笔记之四十七的有向无环图的应用排序
- 节点拓扑应用拓扑排序来解决DAG(directed acylic graph)的单源最短路径问题