The composers graph is a large directed graph, where the nodes represent Wikipedia articles about composers, and the edges represent links between these articles. The graph has too many nodes and edges to be effectively presented in a straightforward way. The task is to combine graph drawing algorithms with appropriate techniques for complexity reduction (such as filtering and varying the graphical attributes) to create an illuminating visualization (one or more images, possibly with commentaries, or a movie). It is by no means a requirement to present the entire data set.
The graph is given as an XML file structured as shown below.
<?xml version="1.0" encoding="UTF-8"?> <graph> <nodes> <node id="4" name="Raymond Deane"/> ... <node id="3408" name="Erland von Koch"/> </nodes> <edges> <edge source="2139" target="3201"/> ... <edge source="1858" target="3201"/> </edges> </graph>