Voer een woord of zin in in een taal naar keuze 👆
Taal:
Vertaling en analyse van woorden door kunstmatige intelligentie
Op deze pagina kunt u een gedetailleerde analyse krijgen van een woord of zin, geproduceerd met behulp van de beste kunstmatige intelligentietechnologie tot nu toe:
- hoe het woord wordt gebruikt
- gebruiksfrequentie
- het wordt vaker gebruikt in mondelinge of schriftelijke toespraken
- opties voor woordvertaling
- Gebruiksvoorbeelden (meerdere zinnen met vertaling)
- etymologie
closed walk - vertaling naar russisch
IN GRAPH THEORY, PATH OF EDGES AND VERTICES WHEREIN A VERTEX IS REACHABLE FROM ITSELF
Directed cycle; Simple cycle; Graph cycle; Cycle (graph); Closed walk; Cycle detection (graph theory)
![closed walk]] H–A–B–A–H in green, a circuit which is a closed walk in which all edges are distinct B–D–E–F–D–C–B in blue, and a cycle which is a closed walk in which all vertices are distinct but the first and last vertices H–D–G–H in red.](https://commons.wikimedia.org/wiki/Special:FilePath/Graph cycle.svg?width=200 "closed walk]] H–A–B–A–H in green, a circuit which is a closed walk in which all edges are distinct B–D–E–F–D–C–B in blue, and a cycle which is a closed walk in which all vertices are distinct but the first and last vertices H–D–G–H in red.")
closed walk
теория графов
замкнутый маршрут
simple cycle
математика
простой цикл
directed cycle
математика
направленный цикл
Definitie
ЗАМКНУТАЯ ТЕЛЕВИЗИОННАЯ СИСТЕМА
содержит: телевизионные передающие камеры (телекамеры) и расположенные на расстоянии до нескольких км от них видеоконтрольные устройства (ВКУ). Телекамеры, связанные с ВКУ кабельными линиями, управляются дистанционно или работают автоматически. Замкнутая телевизионная система используется для решения различных прикладных задач в промышленности, на транспорте, в медицине и т. д.
Wikipedia
Cycle (graph theory)
In graph theory, a cycle in a graph is a non-empty trail in which only the first and last vertices are equal. A directed cycle in a directed graph is a non-empty directed trail in which only the first and last vertices are equal.
A graph without cycles is called an acyclic graph. A directed graph without directed cycles is called a directed acyclic graph. A connected graph without cycles is called a tree.
