edgebundle0.4.2 package

Algorithms for Bundling Edges in Networks and Visualizing Flow and Metro Maps

convert_edges

Convert edges

edge_bundle_force

force directed edge bundling

edge_bundle_hammer

hammer edge bundling

edge_bundle_path

Edge-Path Bundling

edge_bundle_stub

stub edge bundling

edgebundle-package

edgebundle: Algorithms for Bundling Edges in Networks and Visualizing ...

install_bundle_py

install python dependencies for hammer bundling

metro_multicriteria

Metro Map Layout

tnss_dummies

Sample points for triangulated networks

tnss_smooth

Smooth a Steiner tree

tnss_tree

Create Steiner tree from real and dummy points

Download source packageRead PDF manual

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>.

  • Maintainer: David Schoch
  • License: MIT + file LICENSE
  • Last published: 2023-12-16

Useful links