You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
Given an undirected network represented by an adjacency matrix, we may wish to find that network's
- largest component
- number of components
- list of which nodes are in which component together.
This code computes these rapidly (linear in the number of nodes) and accurately. The code is commented so that if you wish to modify it, you may do so.
INPUT:
1. Network adjacency matrix.
OUTPUTS:
1. Number of network components
2. Sizes of network components (sorted, descending)
3. Membership list of each component (sorted by component size, descending).
Code includes a couple examples of usage at the top. I have tested this in R2014a, but it uses nothing fancy, and I believe it to be backward compatible for many years.
Cite As
Daniel Larremore (2026). Find Network Components (https://www.mathworks.com/matlabcentral/fileexchange/42040-find-network-components), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.2.0.0 (4.14 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.2.0.0 | Fixed typos (clarity), removed possibility of self-edges in the example (clarity), changed instances of "cluster" to "component" in comments and variable names (clarity and correctness), and sorted outputs by component sizes (ease of use). |
||
| 1.1.0.0 | Fixed typo in description. |
||
| 1.0.0.0 |
