= Modular decomposition
{wiki=Modular_decomposition}
Modular decomposition is a concept primarily used in graph theory and computer science, particularly in the study of algorithms and structures related to graphs. It involves breaking down a graph into its simpler, modular components or modules based on the relationships between its vertices. \#\#\# Key Concepts: 1. **Module**: In a graph, a module (or a strongly connected component) is a subset of vertices such that every vertex in this subset is equally connected to all the other vertices in the subset.
Back to article page
