adj
Lightweight Adjacency Lists
Provides an S3 class to represent graph adjacency lists using 'vctrs'. Allows for creation, subsetting, combining, and pretty printing of these lists. Adjacency lists can be easily converted to zero-indexed lists, which allows for easy passing of objects to low-level languages for processing.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.1.0 |
rolling linux/jammy R-4.5 | adj_0.1.0.tar.gz |
91.4 KiB |
0.1.0 |
rolling linux/noble R-4.5 | adj_0.1.0.tar.gz |
91.0 KiB |
0.1.0 |
rolling source/ R- | adj_0.1.0.tar.gz |
26.5 KiB |
0.1.0 |
latest linux/jammy R-4.5 | adj_0.1.0.tar.gz |
91.4 KiB |
0.1.0 |
latest linux/noble R-4.5 | adj_0.1.0.tar.gz |
91.0 KiB |
0.1.0 |
latest source/ R- | adj_0.1.0.tar.gz |
26.5 KiB |
0.1.0 |
2026-04-26 source/ R- | adj_0.1.0.tar.gz |
26.5 KiB |
0.1.0 |
2026-04-23 source/ R- | adj_0.1.0.tar.gz |
26.5 KiB |
0.1.0 |
2026-04-09 windows/windows R-4.5 | adj_0.1.0.zip |
96.8 KiB |