x_{1} and x_{2} are path-linked by binary predicate x_{3} (ka; possibly non-symmetric/non-commutative) via a from-x_{1}-to-x_{2}-directed graph geodesic of length x_{4} (li; nonnegative integer or positive infinity) in graph x_{5} (default: maximal) which is generated by relation x_{3}.

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 x_{5} is a proper subgraph of the maximal graph generated by x_{3}, then x_{4} for it will be no less than the x_{4} value that would be attained by x_{5} being maximal (which is the default setting); thus, changing x_{5} allows for the specification of different valid x_{4} values, as in "rirny'utka'au". See also: ".utka", "sei'au", "ka'au", "toryrailu'a", ".utkamtau".

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