Problemcore
Community detection
Also called graph clustering, modularity maximization.
Partition a network into groups of nodes that are densely connected internally.
Partition a network into groups of nodes that are densely connected internally.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag C9RFRX Edit this page History Report an error