utka'au fu'ivla

x1 and x2 are path-linked by binary predicate x3 (ka; possibly non-symmetric/non-commutative) via a from-x1-to-x2-directed graph geodesic of length x4 (li; nonnegative integer or positive infinity) in graph x5 (default: maximal) which is generated by relation x3.

Respects the direction (possibly asymmetry) of the relation so that the graph geodesic distance from A to B may not equal that of from B to A (and either of them may not be defined at all or may be infinite); path-linking is as in ".utka". If x5 is a proper subgraph of the maximal graph generated by x3, then x4 for it will be no less than the x4 value that would be attained by x5 being maximal (which is the default setting); thus, changing x5 allows for the specification of different valid x4 values, as in "rirny'utka'au". See also: ".utka", "sei'au", "ka'au", "toryrailu'a", ".utkamtau".

In notes:

prulamdjedy'utka'au
x1 (event/date) is before x2 (event/date) by x3 (li; integer) days; x1 is x3 days before x2.
rirny'utka'au
x1 is direct ancestor/mentorial-ancestor of x2 of order x3 (li; nonnegative integer) in graph/network of ancestry (family tree) x4 (defaults to maximal option), where x3 is the smallest possible number which is so constrained; x1 is the x3th-great-grandparent of x2.
utka
x1 and x2 are path-linked by binary predicate x3 (ka) via intermediate steps x4 (ce'o; (ordered) list).
utkamtau
x1 and x2 are path-linked by binary predicate x3 (ka; possibly non-symmetric/non-commutative) via some from-x1-to-x2-directed path of length x4 (li; nonnegative integer or positive infinity) in/through graph x5 (default: maximal) which is generated by relation x3.