oaqc
Computation of the Orbit-Aware Quad Census
Implements the efficient algorithm by Ortmann and Brandes (2017) <doi:10.1007/s41109-017-0027-2> to compute the orbit-aware frequency distribution of induced and non-induced quads, i.e. subgraphs of size four. Given an edge matrix, data frame, or a graph object (e.g., 'igraph'), the orbit-aware counts are computed respective each of the edges and nodes.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
2.0.0 |
rolling linux/jammy R-4.5 | oaqc_2.0.0.tar.gz |
99.6 KiB |
2.0.0 |
rolling linux/noble R-4.5 | oaqc_2.0.0.tar.gz |
100.3 KiB |
2.0.0 |
rolling source/ R- | oaqc_2.0.0.tar.gz |
87.3 KiB |
2.0.0 |
latest linux/jammy R-4.5 | oaqc_2.0.0.tar.gz |
99.6 KiB |
2.0.0 |
latest linux/noble R-4.5 | oaqc_2.0.0.tar.gz |
100.3 KiB |
2.0.0 |
latest source/ R- | oaqc_2.0.0.tar.gz |
87.3 KiB |
2.0.0 |
2026-04-26 source/ R- | oaqc_2.0.0.tar.gz |
87.3 KiB |
2.0.0 |
2026-04-23 source/ R- | oaqc_2.0.0.tar.gz |
87.3 KiB |
2.0.0 |
2026-04-09 windows/windows R-4.5 | oaqc_2.0.0.zip |
426.4 KiB |
2.0.0 |
2025-04-20 source/ R- | oaqc_2.0.0.tar.gz |
87.3 KiB |