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 , a flow algorithm based on Steiner trees and a multicriteria optimization method for metro map layouts .


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


0.3.1 by David Schoch, 4 days ago,

Report a bug at

Browse source code at

Authors: David Schoch [aut, cre]

Documentation:   PDF Manual  

MIT + file LICENSE license

Imports Rcpp, igraph, reticulate, interp

Suggests testthat, network, tidygraph

Linking to Rcpp

See at CRAN