Return-path: Envelope-to: jbovlaste-admin@lojban.org Delivery-date: Thu, 22 Jul 2021 08:29:14 -0700 Received: from [192.168.123.254] (port=55036 helo=web.digitalkingdom.org) by stodi.digitalkingdom.org with smtp (Exim 4.94) (envelope-from ) id 1m6adM-001sEE-C8 for jbovlaste-admin@lojban.org; Thu, 22 Jul 2021 08:29:14 -0700 Received: by web.digitalkingdom.org (sSMTP sendmail emulation); Thu, 22 Jul 2021 15:29:12 +0000 From: "Apache" To: curtis289@att.net Reply-To: webmaster@lojban.org Subject: [jvsw] Definition Added At Word grafyjbirai -- By krtisfranks Date: Thu, 22 Jul 2021 15:29:12 +0000 MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Message-Id: X-Spam-Score: -2.9 (--) X-Spam_score: -2.9 X-Spam_score_int: -28 X-Spam_bar: -- In jbovlaste, the user krtisfranks has added a definition of "grafyjbirai" in the language "English". New Data: Definition: $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. Notes: 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}". Jargon: Gloss Keywords: Word: nearest node in graph, In Sense: Word: nearest in graph, In Sense: Word: most-recent, In Sense: graph-nearest Place Keywords: You can go to to see it.