Перевод: с английского на немецкий

с немецкого на английский

simple+path

  • 1 winding

    1. attributive adjective 2. noun
    1) in pl. (of road, river) Windungen
    2) (Electr.) Wicklung, die
    * * *
    adjective (full of bends etc: a winding road.) gewunden
    * * *
    wind·ing
    [ˈwaɪndɪŋ]
    I. adj course, path, river gewunden, sich akk schlängelnd [o windend] attr; road kurvenreich
    II. n
    1. no pl (of course) Windung f
    2. ELEC (coils) Wicklung f; (of machinery) Aufwickeln nt
    * * *
    ['waIndɪŋ]
    1. adj
    river, staircase gewunden; road also kurvenreich
    2. n
    1) (of road, river) Windung f, Kehre f; (fig) Verwicklung f
    2) (ELEC) (= coil) Wicklung f; (= simple twist) Windung f
    * * *
    winding [ˈwaındıŋ]
    A s
    1. Winden n, Spulen n
    2. (Ein-, Auf)Wickeln n, (Um)Wickeln n
    3. (Sich)Winden n, (-)Schlängeln n
    4. Windung f, Biegung f
    5. Umwick(e)lung f
    6. ELEK Wicklung f
    B adj
    1. gewunden:
    a) sich windend oder schlängelnd
    b) Wendel…:
    winding staircase, winding stairs pl Wendeltreppe f
    2. krumm, schief (auch fig)
    3. Winde…, Haspel…:
    winding cable Förderseil n
    * * *
    1. attributive adjective 2. noun
    1) in pl. (of road, river) Windungen
    2) (Electr.) Wicklung, die
    * * *
    adj.
    biegend adj.
    kurvenreich adj.
    schlängelnd adj.
    windend adj.

    English-german dictionary > winding

См. также в других словарях:

  • Simple path — *In geometry, a simple path is a simple curve, namely, a continuous injective function from an interval in the set of real numbers R to R^n or more generally to a metric space or a topological space. *In graph theory a simple path is a path in a… …   Wikipedia

  • Path tracing — is a photorealistic computer graphics rendering technique by James Kajiya when he presented his paper on the rendering equation in the 1980s. The main goal of path tracing is to fully solve the rendering equation. The image quality provided by… …   Wikipedia

  • Path (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… …   Wikipedia

  • Path (computing) — A path is the general form of a file or directory name, giving a file s name and its unique location in a file system. Paths point to their location using a string of characters signifying directories, each path component separated by a… …   Wikipedia

  • Simple traversal of UDP over NATs — Simple Traversal of User Datagram Protocol through Network Address Translators (NATs) (abbreviated STUN), is a standards based IP protocol used as one of the methods of NAT traversal in applications of real time voice, video, messaging, and other …   Wikipedia

  • Simple Mail Transfer Protocol — This article is about the Internet standard for electronic mail transmission. For the email delivery company, see SMTP (company). Internet protocol suite Application layer …   Wikipedia

  • Path integral formulation — This article is about a formulation of quantum mechanics. For integrals along a path, also known as line or contour integrals, see line integral. The path integral formulation of quantum mechanics is a description of quantum theory which… …   Wikipedia

  • PATH (métro) — Port Authority Trans Hudson Port Authority Trans Hudson Situation New Yorket New Jersey …   Wikipédia en Français

  • Path (métro) — Port Authority Trans Hudson Port Authority Trans Hudson Situation New Yorket New Jersey …   Wikipédia en Français

  • Path graph — infobox graph name = Path graph image caption = A path graph vertices = n edges = n 1 automorphisms = 2 diameter = n 1 radius = ⌊n/2⌋ chromatic number = 2 chromatic index = 2 properties = Unit distance Bipartite graphIn the mathematical field of… …   Wikipedia

  • Path coloring — In graph theory, path coloring usually refers to one of two problems: * The problem of coloring a (multi)set of paths R in graph G, in such a way that any two paths of R which share an edge in G receive different colors. Set R and graph G are… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»