A browser for directed graphs
Lawrence A. Rowe, Michael Davis, Eli Messinger et al. · Software Practice and Experience · 1987
Abstract A general‐purpose browser for directed graphs is described. The browser provides operations to examine and edit graphs and to generate a layout for a graph automatically that minimizes edge crossings. Two layout algorithms were implemented. A hierarchical graph layout algorithm was found to be best for directed graphs. The graph browser also has facilities that allow it to be integrated with other applications (e.g. a program browser). These facilities and our experiences building a program call‐graph browser are described.
Cited by 116 works. doi:10.1002/spe.4380170107
Authors
References
- The entity-relationship model—toward a unified view of data
- Efficient Planarity Testing
- The design of POSTGRES
- Spatial management of data
- Methods for Visual Understanding of Hierarchical System Structures
- Query-by-example
- Combinatorial Algorithms: Theory and Practice.
- Hierarchical Wire Routing
- A method for drawing graphs
- An entity-based database user interface