edgebundle
Algorithms for Bundling Edges in Networks and Visualizing Flow and Metro Maps
Implements several algorithms for bundling edges in networks and flow and metro map layouts. This includes force directed edge bundling <doi:10.1111/j.1467-8659.2009.01450.x>, a flow algorithm based on Steiner trees<doi:10.1080/15230406.2018.1437359> and a multicriteria optimization method for metro map layouts <doi:10.1109/TVCG.2010.24>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.4.2 |
rolling linux/jammy R-4.5 | edgebundle_0.4.2.tar.gz |
319.4 KiB |
0.4.2 |
rolling linux/noble R-4.5 | edgebundle_0.4.2.tar.gz |
320.9 KiB |
0.4.2 |
rolling source/ R- | edgebundle_0.4.2.tar.gz |
119.0 KiB |
0.4.2 |
latest linux/jammy R-4.5 | edgebundle_0.4.2.tar.gz |
319.4 KiB |
0.4.2 |
latest linux/noble R-4.5 | edgebundle_0.4.2.tar.gz |
320.9 KiB |
0.4.2 |
latest source/ R- | edgebundle_0.4.2.tar.gz |
119.0 KiB |
0.4.2 |
2026-04-26 source/ R- | edgebundle_0.4.2.tar.gz |
119.0 KiB |
0.4.2 |
2026-04-23 source/ R- | edgebundle_0.4.2.tar.gz |
119.0 KiB |
0.4.2 |
2026-04-09 windows/windows R-4.5 | edgebundle_0.4.2.zip |
640.9 KiB |
0.4.2 |
2025-04-20 source/ R- | edgebundle_0.4.2.tar.gz |
119.0 KiB |