Algorithms for Bundling Edges in Networks and Visualizing Flow
and Metro Maps
![[R logo]](../../../doc/html/Rlogo.svg)
![[Up]](../../../doc/html/left.jpg)
![[Top]](../../../doc/html/up.jpg)
Documentation for package ‘edgebundle’ version 1.0.0
Help Pages
| cali2010 | Migration from California in 2010 |
| convert_edges | Convert edges |
| convert_edges.default | Convert edges |
| convert_edges.igraph | Convert edges |
| convert_edges.network | Convert edges |
| convert_edges.tbl_graph | Convert edges |
| edge_bundle | Edge bundling |
| edge_bundle_force | force directed edge bundling |
| edge_bundle_hammer | hammer edge bundling |
| edge_bundle_mingle | MINGLE edge bundling |
| edge_bundle_path | Edge-Path Bundling |
| edge_bundle_stub | stub edge bundling |
| flow_tree | Spiral flow tree |
| metro_berlin | Subway network of Berlin |
| metro_multicriteria | Metro Map Layout (deprecated) |
| tnss_dummies | Sample points for triangulated networks |
| tnss_smooth | Smooth a Steiner tree |
| tnss_tree | Create Steiner tree from real and dummy points |
| us_flights | Flights within the US |
| us_migration | Migration within the US 2010-2019 |