Reachability - DAGs and Partial Orders

DAGs and Partial Orders

The reachability relation of a directed acyclic graph is a partial order; any partial order may be defined in this way, for instance as the reachability relation of its transitive reduction. If a directed graph is not acyclic, its reachability relation will be a preorder but not a partial order.

Read more about this topic:  Reachability

Famous quotes containing the words partial and/or orders:

    “We were soon in the smooth water of the Quakish Lake,... and we had our first, but a partial view of Ktaadn, its summit veiled in clouds, like a dark isthmus in that quarter, connecting the heavens with the earth.”
    —Henry David Thoreau (1817–1862)

    “God is a foreman with certain definite views
    Who orders life in shifts of work and leisure.”
    —Seamus Heaney (b. 1939)