...表示，vi称为弧尾（Tail），vj称为弧头（Head）。如果图中任意两个顶点之间的边都是有向边，则称该图为有向图（Directed graphs）。 简单图——在图中，若不存在顶点到其自身的边，且同一条边不重复出现，则称这样的图为简单图。
基于8个网页-相关网页
Directed graphs & Partial Orders 有向图和部分排序
signed directed graphs 符号定向图
regular directed graphs 有向正则图
Labelled directed graphs 标记的有向图
associated directed graphs 伴随有向图
conditional directed graphs 条件有向图
first search in directed graphs 有向图中的深度优先搜索
Possibly row-infinite directed graphs 可能行无限的有向图
The topological sort is an important operation of directed graphs.
拓扑排序是有向图的一种重要运算。
Most of these methods are based on the same fundamentality as the SDG (Signed Directed Graphs).
这些方法中的大多数与SDG（符号定向图）在根本原理上相同。
Dependency and directed graphs let you inspect large and complex sets of dependencies or other relationships.
利用依赖项关系图和定向关系图，您可以检查复杂的大型依赖关系或其他关系集。
应用推荐