lojbo jufsisku
Lojban sentence search

Total: 5 result(s)
grafu
experimental gismu x1 is the graph on vertices/nodes x2 (set) and edges x3 (set of ordered tuples of vertices in x2) and with additional properties x4. A "web"/"network". An element of x2 is a "place" in a more generic/abstract/metaphoric sense than spatial; must be discrete. Thus, webpages, family diagrams, lattices, pages in a book, cities and roadways on a map, etc. constitute graphs. x1 also includes trees. Notice that both x2 and x3 are sets; a member of x3 is an orderedmember of x3 is an ordered tuple, but the order only matters if x1 is oriented, in which case the edge connects from the first node in the tuple to the second node in the tuple (there should only be two entries in the tuple) tuple, but the order only matters if x1 is oriented, in which case the edge connects from the first node in the tuple to the second node in the tuple (there should only be two entries in the tuple). x4 can include defining features, weights, etc. Equivalent to grafetu (which is merely the fu'ivla form of this word); very similar to tcana.
tcanaca
fu'ivla x1 is the node of present concern/is the current position in graph x3 (not necessarily oriented; notice the terbri number), connected (possibly indirectly) to/with other nodes x2 (possibly incomplete set) via (oriented) paths x4 "Current position" is in thought. See also: grafu, tcanaba, tcanapu.
grafetu
fu'ivla x1 is the graph on vertices/nodes x2 (set) and edges x3 (set of ordered tuples of vertices in x2) and with additional properties x4. A "web"/"network". An element of x2 is a "place" in a more generic/abstract/metaphoric sense than spatial; must be discrete. Thus, webpages, family diagrams, lattices, pages in a book, cities and roadways on a map, etc. constitute graphs. x1 also includes trees. Notice that both x2 and x3 are sets; an element of x3 is an ordered pair/2-tuple, but the order does not matter unless x1 is oriented, in which case the edge runs from the first node in the tuple to the second node in the tuple. x4 can include defining features, weights, etc. Equivalent to grafu (which is merely the gismu form of this word); very similar to tcana.
tcanaba
fu'ivla x1 (node/vertex/station) is forward of/along from x2 in oriented graph x3 (graph with orientation) using oriented edge path x4 (ordered sequence of ordered pairs). The path from x2 to x1 runs along/is coparallel with/downstream of the orientation on x3 along path x4. Orientation is given from/by x3, so only an edge need be submitted if x3 is fully specified; if x3 is not fully specified, x4 can take the burden of specifying the orientation and subgraph of particular interest (namely, the two vertices x1 and x2, intervening vertices along the path, and the orientation of the given edges connecting them). Note that on an unoriented edge or along a cycle, x1 and x2 might be able to exchange places and/or be equal one another. x4 is an ordered sequence of ordered pairs; the first entry of each pair is the origin node, the second pair is the destination node; the path should probably be connected (so that the destination node of one pair is the origin node of the next, except possibly if it is the last such pair). x1 is not necessarily next (id est: forward adjacent of/from) x2, but it can be. Useful for pages, webpages, family relationships, utterances, etc. See also: grafu, tcanaca, tcanapu.
tcanapu
fu'ivla x1 (node/vertex/station) is backward of/along from x2 in oriented graph x3 (graph with orientation) using oriented edge path x4 (ordered sequence of ordered pairs; oriented edges). The path from x2 to x1 along the (now-unoriented version of the) edges used in x4 is counter/against/upstream of the orientation of x3 (and/or given by the oriented version of x4). Orientation is given from/by x3, so only an edge need be submitted if x3 is fully specified; if x3 is not fully specified, x4 can take the burden of specifying the orientation and subgraph of particular interest (namely, the two vertices x1 and x2, intervening vertices along the path, and the orientation of the given edges connecting them). Note that on an unoriented edge or along a cycle, x1 and x2 might be able to exchange places and/or be equal one another. x4 is an ordered sequence of ordered pairs; the first entry of each pair is the origin node, the second pair is the destination node; the path should probably be connected (so that the destination node of one pair is the origin node of the next, except possibly if it is the last such pair). x1 is not necessarily last (id est: backward adjacent of/from) x2, but it can be. Useful for pages, webpages, family relationships, utterances, etc. See also: grafu, tcanaba, tcanaca