A compound graph is a frequently encountered type of data set in which relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., non-hierarchical edges, together.
Hierarchical edge bundling
