Strongly Connected Component
CHF 43.05
Auf Lager
SKU
DTP8V5FS12K
1 Verfügbar 
Kostenloser Versand ab CHF 50
Geliefert zwischen Mo., 03.11.2025 und Di., 04.11.2025
Details
High Quality Content by WIKIPEDIA articles! High Quality Content by WIKIPEDIA articles! 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 path from b to a. The strongly connected components (SCC) of a directed graph G are its maximal strongly connected subgraphs. If each strongly connected component is contracted to a single vertex, the resulting graph is a directed acyclic graph, the condensation of G. A directed graph is acyclic if and only if it has no (nontrivial) strongly connected subgraphs (because a cycle is strongly connected, and every strongly connected graph contains at least one cycle).
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786131167188
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- EAN 9786131167188
- Format Fachbuch
- Titel Strongly Connected Component
- Herausgeber Betascript Publishing
- Anzahl Seiten 80
- Genre Informatik
Bewertungen
Schreiben Sie eine Bewertung
