Myriel Napoleon Mlle. Baptistine Mme. Magloire Countess de Lo Geborand Champtercier Cravatte Count Old Man Labarre Valjean Marguerite Mme. de R Isabeau Gervais Tholomyes Listolier Fameuil Blacheville Favourite Dahlia Zephine Fantine Mme. Thenardier Thenardier Cosette Javert Fauchelevent Bamatabois Perpetue Simplice Scaufflaire Woman 1 Judge Champmathieu Brevet Chenildieu Cochepaille Pontmercy Boulatruelle Eponine Anzelma Woman 2

Mother Innocent Gribier Jondrette Mme. Burgon Gavroche Gillenormand Magnon Mlle. Gillenormand Mme. Pontmercy Mlle. Vaubois Lt. Gillenormand Marius Baroness T Mabeuf Enjolras Combeferre Prouvaire Feuilly Courfeyrac Bahorel Bossuet Joly Grantaire Mother Plutarch Gueulemer Babet Claquesous Montparnasse Toussaint Child 1 Child 2 Brujon Mme. Hucheloup

http://hci.stanford.edu/jheer/files/zoo/ex/networks/arc.html

networks:

Child 1 Child 2 Mother Plutarch Gavroche Marius Mabeuf Enjolras Combeferre Prouvaire Feuilly Courfeyrac Bahorel Bossuet Joly Grantaire Mme. Hucheloup Jondrette Mme. Burgon Boulatruelle Cosette Woman 2 Gillenormand Magnon Mlle. Gillenormand Mme. Pontmercy Mlle. Vaubois Lt. Gillenormand Baroness T Toussaint Mme. Thenardier Thenardier Javert Pontmercy Eponine Anzelma Gueulemer Babet Claquesous Montparnasse Brujon Marguerite Tholomyes Listolier Fameuil Blacheville Favourite Dahlia Zephine Fantine Perpetue Labarre Valjean Mme. de R Isabeau Gervais Bamatabois Simplice Scaufflaire Woman 1 Judge Champmathieu Brevet Chenildieu Cochepaille Myriel Napoleon Mlle. Baptistine Mme. Magloire Countess de Lo Geborand Champtercier Cravatte Count Old Man Fauchelevent Mother Innocent Gribier

Child 1 Child 2 Mother Plutarch Gavroche Marius Mabeuf Enjolras Combeferre Prouvaire Feuilly Courfeyrac Bahorel Bossuet Joly Grantaire Mme. Hucheloup Jondrette Mme. Burgon Boulatruelle Cosette Woman 2 Gillenormand Magnon Mlle. Gillenormand Mme. Pontmercy Mlle. Vaubois Lt. Gillenormand Baroness T Toussaint Mme. Thenardier Thenardier Javert Pontmercy Eponine Anzelma Gueulemer Babet Claquesous Montparnasse Brujon Marguerite Tholomyes Listolier Fameuil Blacheville Favourite Dahlia Zephine Fantine Perpetue Labarre Valjean Mme. de R Isabeau Gervais Bamatabois Simplice Scaufflaire Woman 1 Judge Champmathieu Brevet Chenildieu Cochepaille Myriel Napoleon Mlle. Baptistine Mme. Magloire Countess de Lo Geborand Champtercier Cravatte Count Old Man Fauchelevent Mother Innocent Gribier

http://hci.stanford.edu/jheer/files/zoo/ex/networks/matrix.html Source: http://www-personal.umich.edu/~mejn/netdata

of data that we may wish to explore through visualization is relationship. For example, given a social network, who is friends with whom? Who are the central players? What cliques exist? Who, if anyone, serves as a bridge between disparate groups? Abstractly, a hierarchy is a specialized form of network: each node has exactly one link to its parent, while the root node has no links. Thus node-link diagrams are also used to visualize networks, but the loss of hierarchy means a different algorithm is required to position nodes.

Mathematicians use the formal term graph to describe a network. A central challenge in graph visualization is computing an effective layout. Layout techniques typically seek to position closely related nodes (in terms of graph distance, such as the number of links between nodes, or other metrics) close in the drawing; critically, unrelated nodes must also be placed far enough apart to differentiate relationships. Some techniques may seek to optimize other visual features—for example, by minimizing the number of edge crossings.

Force-directed Layouts. A common and intuitive approach to network layout is to model the graph as a physical system: nodes are charged particles that repel each other, and links are dampened springs that pull related nodes together. A physical simulation of these forces then determines the node positions; approximation techniques that avoid computing all pairwise forces enable the layout of large numbers of nodes. In addition, interactivity allows the user to direct the layout and jiggle nodes to disambiguate links. Such a force-directed layout is a good starting point for understanding the structure of a general undirected graph. In Figure 5a we use a force-directed layout to view the network of 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.

Arc Diagrams. An arc diagram, shown in Figure 5b, 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