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).

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". See also: ".utka", "sei'au", "ka'au".

- utka
- x
_{1}and x_{2}are path-linked by binary predicate x_{3}(ka) via intermediate steps x_{4}(ce'o; (ordered) list).