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:

    “America is hard to see.
    Less partial witnesses than he
    In book on book have testified
    They could not see it from outside....”
    —Robert Frost (1874–1963)

    “Really, if the lower orders don’t set us a good example, what on earth is the use of them? They seem, as a class, to have absolutely no sense of moral responsibility.”
    —Oscar Wilde (1854–1900)