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.

Multiple nodes may be equally near to x_{2} for a given geodesic distance; x_{1} is such that the geodesic distance between it and x_{2} is positive but otherwise minimal (however, this does not necessarily uniquely specify/define/designate x_{1}). x_{1}, x_{2}, and elements of/nodes in x_{3}, x_{5}, and x_{8} must all share a single edge-connected graph component, namely x_{5}; this word's referent is undefined/errors out otherwise or if no clear graph/connecting relationship exists. Path type for x_{3} should define/be defined by a restrictive characteristic. Default value of x_{7} is "ka zmadu", meaning "the quality of being most-near to x_{2} under the aforementioned conditions, in the same connected graph component, according to aforementioned measurement methods, etc.", as opposed to (for example) "ka mleca", which means "the quality of being the least-near/most-far from x_{2} under the aforementioned conditions, in the same connected graph component, according to aforementioned measurement methods, etc.". x_{1} and x_{2} each are a candidate node for the purposes of this definition. The condition of pairwise distinctness between candidates from x_{2} may be relaxed by specification of or removal of definitional default for x_{3}. See also: "toryrailu'a", "grafyjbi".