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:
“It is characteristic of the epistemological tradition to present us with partial scenarios and then to demand whole or categorical answers as it were.”
—Avrum Stroll (b. 1921)
“The newspapers, especially those in the East, are amazingly superficial and ... a large number of news gatherers are either cynics at heart or are following the orders and the policies of the owners of their papers.”
—Franklin D. Roosevelt (1882–1945)