Connected Subgraph (Strongly Connected Components)
Subgraph connectivity asks us to maintainan understanding of connectivity under vertex updates: updates can turn vertices on and off, and queries refer to the subgraph induced by "on" vertices. (For instance, this is closer to applications in networks of routers, where node faults may occur.)
$V$: number of vertices
$E$: number of edges
Table of Algorithms
Currently no algorithms in our database for the given problem.