-
21 strongly connected relation
Математика: сильно связное отношениеУниверсальный англо-русский словарь > strongly connected relation
-
22 strongly connected set
Математика: сильно связное множествоУниверсальный англо-русский словарь > strongly connected set
-
23 strongly connected diagrams
English-russian dictionary of physics > strongly connected diagrams
-
24 strongly connected components
English-Russian electronics dictionary > strongly connected components
-
25 strongly connected digraph
English-Russian electronics dictionary > strongly connected digraph
-
26 strongly connected components
The New English-Russian Dictionary of Radio-electronics > strongly connected components
-
27 strongly connected digraph
The New English-Russian Dictionary of Radio-electronics > strongly connected digraph
-
28 strongly connected graph
English-Russian dictionary of computer science and programming > strongly connected graph
-
29 strongly-connected graph
• силносвързан графEnglish-Bulgarian polytechnical dictionary > strongly-connected graph
-
30 strongly-connected graphs
• силносвързан графEnglish-Bulgarian polytechnical dictionary > strongly-connected graphs
-
31 strongly connected automaton
матем.English-Russian scientific dictionary > strongly connected automaton
-
32 strongly connected class
матем.English-Russian scientific dictionary > strongly connected class
-
33 strongly connected complex
матем.English-Russian scientific dictionary > strongly connected complex
-
34 strongly connected machine
English-Russian scientific dictionary > strongly connected machine
-
35 strongly connected relation
English-Russian scientific dictionary > strongly connected relation
-
36 strongly connected set
English-Russian scientific dictionary > strongly connected set
-
37 strongly connected graph
stacked graph — "этажерочный" график
-
38 strongly connected graph
English-Russian information technology > strongly connected graph
-
39 strongly connected digraph
English-Russian dictionary of electronics > strongly connected digraph
-
40 connected
1. a связанный, соединённый2. a имеющий связи3. a связныйСинонимический ряд:1. coupled (adj.) adjoined; attached; combined; coupled; in tandem; joined; linked; merged; united2. joined in order (adj.) coherent; concatenated; consecutive; constant; contiguous; joined in order; undivided3. mutual (adj.) collective; common; joint; mutual; shared4. plugged in (adj.) hot; in circuit; live; plugged in; wired5. related (adj.) applicable; associated; interrelated; pertinent; related; relevant6. coupled (verb) affixed; attached; clipped; coupled; fastened; fixed; moored; secured7. joined (verb) affiliated; allied; associated; bound; bracketed; coalesced; combined; compounded; concreted; conjoined; conjugated; correlated; identified; joined; linked; married; melded; related; united; wedded; yoked
См. также в других словарях:
Strongly connected component — Graph with strongly connected components marked A directed graph is called strongly connected if there is a path from each vertex in the graph to every other vertex. In particular, this means paths in each direction; a path from a to b and also a … Wikipedia
strongly connected component — noun Given a directed graph, a maximal strongly connected subgraph. See Also: connected component, partition … Wiktionary
strongly connected — adjective a) Of a directed graph, such that for every pair of vertices u and v there is a path from u to v and a path from v to u. b) Of a directed graph, such that for every pair of vertices u and v there is a directed path either from u to v or … Wiktionary
Tarjan's strongly connected components algorithm — Tarjan s Algorithm (named for its discoverer, Robert Tarjan) is a graph theory algorithm for finding the strongly connected components of a graph. It can be seen as an improved version of Kosaraju s algorithm, and is comparable in efficiency to… … Wikipedia
Connected component (graph theory) — A graph with three connected components. In graph theory, a connected component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices. For example,… … Wikipedia
connected component — noun A connected subset that is, moreover, maximal with respect to being connected. See Also: strongly connected component … Wiktionary
Connected Mathematics — is a comprehensive, problem centered curriculum designed for all students in grades 6 8 based on the NCTM standards. The curriculum was developed by the Connected Mathematics Project (CMP) at Michigan State University and funded by the National… … Wikipedia
Connected Urban Development — (CUD) is a private/public partnership, initiated in 2006 by Cisco in cooperation with the cities of Amsterdam, San Francisco and Seoul, to work towards a further reduction of carbon emissions through improvements in the efficiency of the urban… … Wikipedia
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Aperiodic graph — In the mathematical area of graph theory, a directed graph is said to be aperiodic if there is no integer k > 1 that divides the length of every cycle of the graph. Equivalently, a graph is aperiodic if the greatest common divisor of the lengths… … Wikipedia