Strongly Connected Components: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| (5 intermediate revisions by the same user not shown) | |||
| Line 10: | Line 10: | ||
== Parameters == | == Parameters == | ||
$V$: number of vertices | |||
E: number of edges | |||
$E$: number of edges | |||
== Table of Algorithms == | == Table of Algorithms == | ||
| Line 17: | Line 18: | ||
Currently no algorithms in our database for the given problem. | Currently no algorithms in our database for the given problem. | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:Strongly Connected Components - Time.png|1000px]] | [[File:Strongly Connected Components - Time.png|1000px]] | ||
Latest revision as of 09:06, 28 April 2023
Description
The strongly connected components or diconnected components of an arbitrary directed graph form a partition into subgraphs that are themselves strongly connected.
Related Problems
Related: Transitive Closure, Maximum Strongly Connected Component, Strong Connectivity (dynamic), 2 Strong Components (dynamic), Connected Subgraph
Parameters
$V$: number of vertices
$E$: number of edges
Table of Algorithms
Currently no algorithms in our database for the given problem.
Time Complexity Graph
Error creating thumbnail: Unable to save thumbnail to destination