Editing Directed acyclic graph

A '''directed acyclic graph (DAG)''' is a directed [[graph]] that contains no cycles. DAGs arise in a natural way in modelling situations in which, in some sense, going "forward" is sometimes possible but going "backward" is definitely not, so that if <math>v</math> is reachable from <math>u</math>, we know that <math>u</math> is ''not'' reachable from <math>v</math> (unless <math>u = v</math>). An example is given by {{Problem|ccc07s4|Water Park}} from [[CCC]] 2007. In the absence of mechanical intervention, water always flows from high altitudes to low altitudes, so that, when travelling along the waterslides, one can never arrive at the same spot twice. If we create a graph that has a vertex for each marked point in the water park and a directed edge from <math>u</math> to <math>v</math> whenever there is a water slide from <math>u</math> to <math>v</math>, this graph will be acyclic, and hence a DAG. DAGs do not necessarily resemble ''undirected'' acyclic graphs (that is, [[Tree|forests]]) in form or in their properties; there may be multiple paths between a given pair of nodes.

==As a partial order==
DAGs are often considered representations of partial orderings. We can establish a correspondence as follows:
# Give each vertex of the DAG a unique label (such as the letters '''A''', '''B''', '''C''', ''etc''.). Each label corresponds to an element in our set.
# We define our partial ordering as follows: <math>a \leq b</math> in the ordering if and only if there exists a path from <math>u</math> to <math>v</math>, where <math>u</math> is the vertex in the DAG labelled with <math>a</math> and <math>v</math> is the vertex in the DAG labelled with <math>b</math>.
The ordering thus defined is reflexive, since every vertex is reachable from itself. It is antisymmetric, because if <math>u \leq v</math> and <math>v \leq u</math>, and <math>u \neq v</math>, then we have a cycle that contains <math>a</math> and <math>b</math>, a contradiction. And it is transitive because reachability is transitive; if there are paths from <math>u</math> to <math>v</math> and from <math>v</math> to <math>w</math> then we can concatenate them to obtain a path from <math>u</math> to <math>w</math>. So the ordering we have defined is a partial ordering.

Note that whereas a given DAG will correspond to exactly one partial ordering (up to isomorphism) using this convention, there may be more than one DAG that corresponds to a given partial ordering. The DAG with the greatest number of edges that corresponds to a given partial ordering is known as the [[transitive closure]], whereas the one with the fewest number of edges is known as the [[transitive reduction]].