An arc diagram uses a one-dimensional layout of nodes, with circular arcs to represent links. Though an arc diagram may not convey the overall structure of the graph as effectively as a two-dimensional layout, with a good ordering of nodes it is easy to identify cliques and bridges. Further, as with the indented tree, multivariate data can easily be displayed alongside nodes.
This network represents character co-occurrence in the chapters of Victor Hugo's classic novel, Les Misérables. Node colors depict cluster memberships computed by a community-detection algorithm. Source: Knuth, D. E. 1993. The Stanford GraphBase: A Platform for Combinatorial Computing, Addison-Wesley.
Next: Force-Directed Layouts
<html>
<head>
<title>Les Misérables Arc</title>
<link type="text/css" rel="stylesheet" href="ex.css?3.2"/>
<script type="text/javascript" src="../protovis-r3.2.js"></script>
<script type="text/javascript" src="miserables.js"></script>
<style type="text/css">
#fig {
width: 880px;
height: 400px;
}
</style>
</head>
<body><div id="center"><div id="fig">
<script type="text/javascript+protovis">
var vis = new pv.Panel()
.width(880)
.height(310)
.bottom(90);
var arc = vis.add(pv.Layout.Arc)
.nodes(miserables.nodes)
.links(miserables.links)
.sort(function(a, b) a.group == b.group
? b.linkDegree - a.linkDegree
: b.group - a.group);
arc.link.add(pv.Line);
arc.node.add(pv.Dot)
.size(function(d) d.linkDegree + 4)
.fillStyle(pv.Colors.category19().by(function(d) d.group))
.strokeStyle(function() this.fillStyle().darker());
arc.label.add(pv.Label)
vis.render();
</script>
</div></div></body>
</html>