Dániel Kovács AFulgens

Programming Assignment 2, for the Coursera course Data Visualization.

It uses a radial layout with hierarchical edge bundling in D3, showing character co-appearances in the Les Miserables novel. With the radio buttons the data is ordered in three different ways: the original ordering from the dataset, alphabetical based on the characters' names, and based on their weight (i.e. how many co-appearances they have, which translates to the degree of the nodes).

The code was shamelessly copied from Mike Bostock's Hierarchical Edge Bundling demo, and modified wherever needed.

Sadly, interactive re-layouting did not work in the couple hours I spent with this assignment, thus a static page-reload is done for re-ordering.

Keybase proof

I hereby claim:

I am afulgens on github.
I am dko (https://keybase.io/dko) on keybase.
I have a public key whose fingerprint is 6994 8AC6 9195 3F63 C7ED E628 BA16 3196 6BBD 8386

To claim this, I am signing this object:

	#####################
	# MANDATORY: BASICS #
	#####################
	[user]
	# your e-mail address for two keys to have general tooling support
	email = [email protected]
	mail = [email protected]
	# your name in <firstname> <surname> format, accentise as you see fit (but be consistent across projects!)
	name = Robert Weiser
	[core]

	package org.sample;

	import java.util.HashMap;
	import java.util.IdentityHashMap;
	import java.util.LinkedHashMap;
	import java.util.Map;
	import java.util.Map.Entry;
	import java.util.TreeMap;
	import java.util.UUID;
	import java.util.concurrent.ConcurrentHashMap;