or polytrees are DAGs formed by orienting the edges of trees (connected, acyclic undirected graphs).
***** Rooted trees are oriented trees in which all edges of the underlying undirected tree are directed either away from or towards the root (they are called, respectively, arborescences or out-trees, and in-trees.

Digraphs with supplementary properties

* Weighted directed graphs (also known as directed networks) are (simple) directed graphs with weights

1.Previous
3.Next