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:

    “The one-eyed man will be King in the country of the blind only if he arrives there in full possession of his partial faculties—that is, providing he is perfectly aware of the precise nature of sight and does not confuse it with second sight ... nor with madness.”
    —Angela Carter (1940–1992)

    “I’ve got orders to obey, thank God.”
    —Robert Bolt (1924–1995)