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:

    “And meanwhile we have gone on living,
    Living and partly living,
    Picking together the pieces,
    Gathering faggots at nightfall,
    Building a partial shelter,
    For sleeping and eating and drinking and laughter.”
    —T.S. (Thomas Stearns)

    “Your money’s no good here. Orders of the house.”
    —Stanley Kubrick (b. 1928)