Construct an aggregate of all graphs in the sequence. The super-graph contains all nodes and edges in the network during the complete time interval.
Compute a layout of the super-graph. Use brushing to filter nodes and edges for a given time interval. Visualize only the network elements within the time interval specified by the brushing filter, i.e., set nodes to be transparent if they are outside the specified time interval. Node size is computed using degree-centrality. The centrality of the nodes is calculated for the time interval being visualized.
Visualization of the GEXF data set dynamic Java code, dynamic source code structure of a Java program by the evolution of commits on the SVN, by S.Heymann & J.Bilcke, 2008. In the visualization below, slide the brush filter to animate the visualization. The size of the interval can be changed. Double-click to clear the brush, or select everything if the brush-selector is empty.