Path Visualization for Adjacency Matrices

For displaying a dense graph, an adjacency matrix is superior than a node-link diagram because it is more compact and free of visual clutter. A node-link diagram, however, is far better for the task of path finding because a path can be easily traced by following the corresponding links, provided that the links are not heavily crossed or tangled. We augment adjacency matrices with path visualization and associated interaction techniques to facilitate path finding. Our design is visually pleasing, and also effectively displays multiple paths based on the design commonly found in metro maps. We illustrate and assess the key aspects of our design with the results obtained from two case studies and an informal user study. Categories and Subject Descriptors (according to ACM CCS): I.3.6 [Computer Graphics]: Methodology and Techniques; H.5 [Information Systems]: Information Interfaces and Presentation; G.2.2 [Graph Theory]: Path and Circuit Problems

• Type: Conference
• Year: 2007
• Where: VISSYM
• Authors: Zeqian Shen, Kwan-Liu Ma
• Keywords: Adjacency Matrix, Node-link Diagram, Path Finding, VISSYM 2007, Visualization