spanning walk - перевод на русский
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

spanning walk - перевод на русский

MODEL FOR A RANDOM SIMPLE PATH
Loop erased random walk; LERW; Uniform spanning tree; Uniform Spanning Tree; Wilson's algorithm
Найдено результатов: 355
spanning walk      

математика

остовной маршрут

minimal spanning tree         
  • T}}.
  • This figure shows there may be more than one minimum spanning tree in a graph. In the figure, the two trees below the graph are two possibilities of minimum spanning tree of the given graph.
DATA STRUCTURE, SUBGRAPH OF A WEIGHTED GRAPH
Spanning tree algorithm; Minimal spanning tree; Shortest spanning tree; Minimum spanning forest; Minimum weight spanning tree; Minimum weight spanning forest; Minimum cost spanning tree; Minimum Spanning Tree; Minimum spanning tree problem; Spanning tree problem; Minimum k-node-connected spanning network problem; Minimum k-edge-connected spanning network problem; Minimum Weight Spanning Tree; Minimum spanning trees; Min spanning tree; Parallel algorithms for the minimum spanning tree problem; Algorithms for finding minimum spanning trees; Applications of the minimum spanning tree problem; Applications of minimum spanning trees
минимальное связывающее дерево
shortest spanning tree         
  • T}}.
  • This figure shows there may be more than one minimum spanning tree in a graph. In the figure, the two trees below the graph are two possibilities of minimum spanning tree of the given graph.
DATA STRUCTURE, SUBGRAPH OF A WEIGHTED GRAPH
Spanning tree algorithm; Minimal spanning tree; Shortest spanning tree; Minimum spanning forest; Minimum weight spanning tree; Minimum weight spanning forest; Minimum cost spanning tree; Minimum Spanning Tree; Minimum spanning tree problem; Spanning tree problem; Minimum k-node-connected spanning network problem; Minimum k-edge-connected spanning network problem; Minimum Weight Spanning Tree; Minimum spanning trees; Min spanning tree; Parallel algorithms for the minimum spanning tree problem; Algorithms for finding minimum spanning trees; Applications of the minimum spanning tree problem; Applications of minimum spanning trees
кратчайший остов
spanning         
WIKIMEDIA DISAMBIGUATION PAGE
Spanned; Spanning (disambiguation)

общая лексика

стягивающий

натянутый

spanned         
WIKIMEDIA DISAMBIGUATION PAGE
Spanned; Spanning (disambiguation)

общая лексика

натянутый

охваченный

Смотрите также

cumulative throughflow; fractional throughflow

spanning tree         
  • A spanning tree (blue heavy edges) of a [[grid graph]]
  • [[Cayley's formula]] counts the number of spanning trees on a complete graph. There are <math>2^{2-2}=1</math> trees in <math>K_2</math>,
<math>3^{3-2}=3</math> trees in <math>K_3</math>, and <math>4^{4-2}=16</math>
trees in <math>K_4</math>.
SUBGRAPH OF AN UNDIRECTED GRAPH G THAT IS A TREE WHICH INCLUDES ALL OF THE VERTICES OF G
Spanning forest; Spanning Tree; Spanning tree (Mathematics); Spanning tree (networks); Spanning Tree (mathematics); Fundamental cycle; Fundamental cutset; Spanning tree (mathematics)

общая лексика

связующее дерево

алгоритм, позволяющий установить множество параллельных независимых маршрутов между несколькими локальными сетями или сегментами таких сетей. Применяется в соединительных (связующих) устройствах

математика

остовное дерево

Смотрите также

interconnect device; STA; STP

spanning forest         
  • A spanning tree (blue heavy edges) of a [[grid graph]]
  • [[Cayley's formula]] counts the number of spanning trees on a complete graph. There are <math>2^{2-2}=1</math> trees in <math>K_2</math>,
<math>3^{3-2}=3</math> trees in <math>K_3</math>, and <math>4^{4-2}=16</math>
trees in <math>K_4</math>.
SUBGRAPH OF AN UNDIRECTED GRAPH G THAT IS A TREE WHICH INCLUDES ALL OF THE VERTICES OF G
Spanning forest; Spanning Tree; Spanning tree (Mathematics); Spanning tree (networks); Spanning Tree (mathematics); Fundamental cycle; Fundamental cutset; Spanning tree (mathematics)

математика

остовный лес

fundamental cycle         
  • A spanning tree (blue heavy edges) of a [[grid graph]]
  • [[Cayley's formula]] counts the number of spanning trees on a complete graph. There are <math>2^{2-2}=1</math> trees in <math>K_2</math>,
<math>3^{3-2}=3</math> trees in <math>K_3</math>, and <math>4^{4-2}=16</math>
trees in <math>K_4</math>.
SUBGRAPH OF AN UNDIRECTED GRAPH G THAT IS A TREE WHICH INCLUDES ALL OF THE VERTICES OF G
Spanning forest; Spanning Tree; Spanning tree (Mathematics); Spanning tree (networks); Spanning Tree (mathematics); Fundamental cycle; Fundamental cutset; Spanning tree (mathematics)

математика

фундаментальный цикл

cake-walk         
  • Cakewalk poster, 1896
  • 1915 sheet music cover (late for cakewalk music): "Ebony Echoes: A Good Old-Fashioned Cake-Walk" by Dan Walker. New York, NY: Shapiro, Bernstein & Co.
  • Cakewalk dance, 1896
  • Eugénie Fougère on the 18 October 1903 cover of ''Paris qui Chante'' dancing to the song 'Oh ! ce cake-walk'
  • George Walker, Aida Overton Walker, and Bert Williams link arms and dance the cakewalk in the first Broadway musical to be written and performed by African Americans, ''[[In Dahomey]]''.
  • Painting from 1913
MUSIC GENRE AND TYPE OF DANCE
Cake walk; Cake-walk; Cakewalks; Cakewalker

существительное

общая лексика

кекуок (танец)

sponsored walk         
TYPE OF FUNDRAISER
Sponsored walk; Walkathons; Walk-a-thon; Walking marathon; Charity walk; Walk-a-thons; Walk for Development; Walk for development

[,spɔnsəd'wɔ:k]

общая лексика

субсидируемый поход (в кот. обыкн. принимает участие молодёжь; проводится в рекламных и благотворительных целях)

Определение

spanning tree algorithm
An IEEE 802.1 standard under consideration which will provide distributed routing over multiple LANs connected by bridges.

Википедия

Loop-erased random walk

In mathematics, loop-erased random walk is a model for a random simple path with important applications in combinatorics, physics and quantum field theory. It is intimately connected to the uniform spanning tree, a model for a random tree. See also random walk for more general treatment of this topic.

Как переводится spanning walk на Русский язык