grafu experimental gismu

x1 is the graph on vertices/nodes x2 (set) and edges x3 (set of ordered or unordered 2-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 a 2-tuple, but the order matters iff x1 is oriented - in which case, the edge connects from the first node in the tuple to the second node 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.

In notes:

ki'irgrafu
x1 is a relation space formed from elements/nodes in set x2 and relationship x3 which connects them.
turne'i
x1 is a descendant of x2 in hierarchy x3
turnersei
x1 is a descendant of x2, x3 levels down from it, in hierarchy x4
tursei
x1 is x3 (undirected) hops away from x2 in graph x4
grafetu
x1 is the graph on vertices/nodes x2 (set) and edges x3 (set of ordered or unordered tuples of vertices in x2) and with additional properties x4.
grafnseljimca
x1 is a tree graph on nodes x2 (set of points), with edges x3 (set of ordered or unordered 2-tuples), with additional properties x4.
tcanaba
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.
tcanaca
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
tcanapu
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).
treicu
x1 is a (general(ized)) heirarchical/pyramidal/directed tree-graph structure on underlying set x2 via partial ordering relation x3 (see notes for default properties).
turnela
x1 is a child of x2 (one level below it) in hierarchy x3
turtuba
x1 and x2 share common parent x3 in hierarchy x4