samseltcana
lujvo t_{2} is a/the computer network that includes nodes t_{1}=s_{1} whose function/purpose is s_{2}. Cf. skami, tcana, mujysamseltcana, kagysamseltcana, selklosamseltcana, tolselklosamseltcana.


tivni


fatri


kagysamseltcana


litru


mrilu
gismu rafsi: mri x_{1} mails/posts [transfer via intermediary service] x_{2} to recipient address x_{3} from mailbox/post office/sender address x_{4} by carrier/network/system x_{5}. Also x_{4} post office, mailbox. (cf. benji In which the medium need not be a 3rd party service/system, and x_{2} need not consist of discrete units. notci, xatra, tcana)


tcanylu'a
lujvo x_{1}=p_{1} is a network route/path to node x_{2}=p_{2}=t_{1} from node x_{3}=p_{3}=t_{1} via points/nodes x_{4}=p_{4} within transport/communication/distribution system/network x_{5}=t_{2}. Unusual in that t_{1} appears more than once. x_{4} is also really a set of t_{1}s. See also tcana, pluta


trene
gismu rafsi: ren re'e x_{1} is a train [vehicle] of cars/units x_{2} (mass) for rails/system/railroad x_{3}, propelled by x_{4}. A railed vehicle or train of vehicles; also subway (tu'unre'e), metro, trolley, tramway (= lajre'e), roller coaster; monorail (= dadre'e); cable car, sky car, ski lift (= cildadre'e). See also tcana.


benji
gismu rafsi: bej be'i x_{1} transfers/sends/transmits x_{2} to receiver x_{3} from transmitter/origin x_{4} via means/medium x_{5}. Also possibly "sharing"; no (complete) alienation from origin is implied. x5 carrier. See also muvdu, dunda, mrilu, nirna, xruti, cradi, tivni, preja, cmavo list be'i, bevri, mrilu, tcana.


ciste
gismu rafsi: ci'e x_{1} (mass) is a system interrelated by structure x_{2} among components x_{3} (set) displaying x_{4} (ka). x_{1} (or x_{3}) is synergistic in x_{4}; also network; x_{2} also relations, rules; x_{3} also elements (set completely specified); x_{4} systemic functions/properties. See also cmavo list ci'e, cmima, girzu, gunma, stura, tadji, munje, farvi, ganzu, judri, julne, klesi, morna, tcana.


dikca
gismu rafsi: dic x_{1} is electricity [electric charge or current] in/on x_{2} of polarity/quantity x_{3} (def. negative). (x_{3}, a quantifier, can be expressed as a simple polarity using the numerals for positive and negative ma'u and ni'u); (explicitly) negative (= dutydikca), positive (= mardikca); current (= selmuvdikca, muvdikca; again default negative/electron current), charge (= klodikca, stadikca). See also lindi, xampo, flecu, maksi, tcana.


pluta
gismu rafsi: lut lu'a x_{1} is a route/path/way/course/track to x_{2} from x_{3} via/defined by points including x_{4} (set). A route merely connects origin/destination, but need not be improved in any way; (x_{4} is a set of points at least sufficient to constrain the route relevantly). (cf. litru, naxle, tcana, dargu, klaji, ve klama; tadji, zukte for means to a goal, klama, pagre)


grafetu
fu'ivla x_{1} is the graph on vertices/nodes x_{2} (set) and edges x_{3} (set of ordered tuples of vertices in x_{2}) and with additional properties x_{4}. 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/2tuple, 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.


grafu
experimental gismu x_{1} is the graph on vertices/nodes x_{2} (set) and edges x_{3} (set of ordered tuples of vertices in x_{2}) and with additional properties x_{4}. 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.
