Force-directed edge bundling
Branch: master
Clone or download
Pull request Compare This branch is 2 commits behind synesenom:master.
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
src
test
.gitignore
LICENSE
Makefile
README.rst

README.rst

fdeb

Force-directed edge bundling for undirected networks

Author: Enys Mones
Version: 0.1
License:MIT

This program implements the force-directed edge bundling algorithm of Holten and van Wijk in C++ [1].

Requirements

OpenGL, which is already available on most systems and a recent g++ compiler.

Compilation

Just run make.

Usage

If no arguments are passed, the program prints the help menu that contains all available options.

Input files

Two input files are required: a CSV file (with spaces as delimiters) containing three columns (node label, x coordinate, y coordinate) and a space-delimitered CSV file containing the edge source and target labels.

Test

The test directory contains a test file of the US airline network.

Output file

Network in JSON format. Nodes have three keys (label, x, y), edges have only the coordinates of the subdivision points.

TODO

SVG support for output.

Bibliography

[1]Danny Holten and Jarke van Wijk: Force-Directed Edge Bundling for Graph Visualization. Computer Graphics Forum (Blackwell Publishing Ltd) 28, no. 3 (2009): 983-990.