x1 (node in graph) is near x2 (node in same connected graph component), such that they are path-connected, along path(s) x3 (default: at least one pairwise graph geodesic, with no restriction on which paths are considered) according to edge weighings x4 in connected graph component x5, with nearness standard/satisfying other conditions x6.
x1 need not be distinct from x2, but they must share a connected graph component (undefined otherwise or if no clear graph/connecting relationship exists). See also: "toryrailu'a".