Partial Order Tree

A Partial Order Tree is a DAG that is a partially ordered set (T,<=) such that there is an infium of [math]T[/math], and each subset {x in T: x<=y} is finite and is linearly ordered under <=.

• Context:
  • It can have a Graph Cycle if converted to an Undirected Graph.
• See: Successor Tree

---