Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:
общая лексика
отцеп вагонов
['zedkɑ:z]
общая лексика
"Автомашины зед" (многосерийный теледетектив из жизни английской полиции; передавался по каналу Би-би-си-1 [BBC 1] с 1962 по 1978)
Z car - изменённое название патрульного автомобиля [Q-car] Департамента уголовного розыска [Criminal Investigation Department]
существительное
общая лексика
граненое стекло
In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. Any cut determines a cut-set, the set of edges that have one endpoint in each subset of the partition. These edges are said to cross the cut. In a connected graph, each cut-set determines a unique cut, and in some cases cuts are identified with their cut-sets rather than with their vertex partitions.
In a flow network, an s–t cut is a cut that requires the source and the sink to be in different subsets, and its cut-set only consists of edges going from the source's side to the sink's side. The capacity of an s–t cut is defined as the sum of the capacity of each edge in the cut-set.