<theory> A set X is directed under some relation, <= (less than or
equal), if it is non-empty and if for any two elements x and y there exists an
element z such that x <= z and y <= z. I.e. all pairs have an upper bound.
directed acyclic graph « directed graph « Directed
directed set » Direct Inward Dialing »
directional coupler » Directly Executable Test