path length
11null path length — noun The path length from a given node to its nearest descendant null node in a binary tree …
12leakage path length — nuotėkio takelio ilgis statusas T sritis radioelektronika atitikmenys: angl. leakage path length vok. Kriechweglänge, f rus. длина пути утечки, f pranc. distance de fuite superficielle, f …
13actual path length — faktinis kelio ilgis statusas T sritis fizika atitikmenys: angl. actual path length vok. tatsächliche Weglänge, f rus. фактическая длина пробега, f pranc. longueur réelle de parcours, f …
14geometrical path length — geometrinis kelio ilgis statusas T sritis fizika atitikmenys: angl. geometrical path length vok. geometrische Weglänge, f rus. геометрическая длина пробега, f pranc. chemin géométrique, m …
15optical path length — optinis kelio ilgis statusas T sritis fizika atitikmenys: angl. optical path length vok. optische Weglänge, f rus. оптическая длина пути, f pranc. longueur de trajet optique, f …
16length of path — kelio ilgis statusas T sritis Standartizacija ir metrologija apibrėžtis Atstumas tarp dviejų viena nuo kitos nutolusių kelio vietų. atitikmenys: angl. length of path; path length vok. Weglänge, f rus. длина пробега, f; длина пути, f pranc.… …
17Path 26 — is a set of three 500 kV power lines that forms Southern California Edison s (SCE) intertie with Pacific Gas Electric (PG E) to the north. Since PG E s power grid and SCE s grid both have interconnections to elsewhere in the Pacific Northwest and …
18Path 61 — or the Lugo Victorville 500 kV Line is a relatively short AC 500 kV power line that runs from Southern California Edison s (SCE) Lugo substation southwest of Hesperia to Los Angeles Department of Water and Power s (LADW P) Victorville substation… …
19Path (topology) — The points traced by a path from A to B in R². However, different paths can trace the same set of points. In mathematics, a path in a topological space X is a continuous map f from the unit interval I = [0,1] to X f : I → X. The initial… …
20Path (graph theory) — In graph theory, a path in a graph is a sequence of vertices such that from each of its vertices there is an edge to the next vertex in the sequence. The first vertex is called the start vertex and the last vertex is called the end vertex . Both… …
