x_{1} is the geodesic path from x_{2} to x_{3} via or through points including/on connected manifold component/in connected graph component x_{4}, with distance being measured by standard/metric/weighting x_{5}.

x_{1} and x_{2} must belong to the same connected component (which includes/encompasses x_{4}). The overall 'distance' travelled must be the minimal option under the orientation (from x_{2} to x_{3}; this is not always symmetric) and path weighting/the specified metric such that the points x_{4} are included in the path or the path is in/on connected manifold/graph component x_{4} (as appropriate). In other words, x_{1} includes a geodesic from x_{2} to x_{3} through/on/along/in points or space x_{4}. If the notion of distance is well-formed, then the triangle inequality should be satisfied and, therefore, x_{1} should be composed of certain of geodesic subpaths between points in x_{4} U Set(x_{2}, x_{3}). If x_{4} is oriented or is an ordered list of points, then the path must connect them in that order (or a permitted order if there are multiple options).

- grafyjbi
- x
_{1}(node in graph) is near x_{2}(node in same connected graph component), such that they are path-connected, along path(s) x_{3}(default: at least one pairwise graph geodesic, with no restriction on which paths are considered) according to edge weighings x_{4}in connected graph component x_{5}, with nearness standard/satisfying other conditions x_{6}. - grafyjbirai
- x
_{1}(node in graph) is among the very nearest nodes to x_{2}(node in same graph), such that they are path-connected, along path(s) or paths of type x_{3}(default: directed graph geodesics from x_{2}to candidate other nodes, such that each of these candidates (plus x_{1}) are pairwise distinct from x_{2}) according to edge weighings x_{4}in connected graph component x_{5}, with nearness standard/satisfying other conditions x_{6}, the extreme x_{7}(default: ka zmadu, implying most-near) being amongst set/range x_{8}of candidate nodes. - utka'au
- 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}.