Relation To Other Kinds of Graphs
A polytree is a directed graph formed by orienting the edges of a free tree. Every polytree is a DAG. In particular, this is true of the arborescences formed by directing all edges outwards from the root of a tree. A multitree (also called a strongly ambiguous graph or a mangrove) is a directed graph in which there is at most one directed path (in either direction) between any two nodes; equivalently, it is a DAG in which, for every node v, the set of nodes reachable from v forms a tree.
Any undirected graph may be made into a DAG by choosing a total order for its vertices and orienting every edge from the earlier endpoint in the order to the later endpoint. However, different total orders may lead to the same acyclic orientation. The number of acyclic orientations is equal to |χ(-1)|, where χ is the chromatic polynomial of the given graph.
Any directed graph may be made into a DAG by removing a feedback vertex set or a feedback arc set. However, the smallest such set is NP-hard to find. An arbitrary directed graph may also be transformed into a DAG, called its condensation, by contracting each of its strongly connected components into a single supervertex. When the graph is already acyclic, its smallest feedback vertex sets and feedback arc sets are empty, and its condensation is the graph itself.
Read more about this topic: Directed Acyclic Graph
Famous quotes containing the words relation to, relation and/or kinds:
“... a worker was seldom so much annoyed by what he got as by what he got in relation to his fellow workers.”
—Mary Barnett Gilson (1877?)
“[Mans] life consists in a relation with all things: stone, earth, trees, flowers, water, insects, fishes, birds, creatures, sun, rainbow, children, women, other men. But his greatest and final relation is with the sun.”
—D.H. (David Herbert)
“So, if we must give a general formula applicable to all kinds of soul, we must describe it as the first actuality [entelechy] of a natural organized body.”
—Aristotle (384323 B.C.)