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

x_{1} need not be distinct from x_{2}, but they must share a connected graph component (undefined otherwise or if no clear graph/connecting relationship exists). See also: "toryrailu'a".

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