A browser for directed graphs
- 1 January 1987
- journal article
- Published by Wiley in Software: Practice and Experience
- Vol. 17 (1) , 61-76
- https://doi.org/10.1002/spe.4380170107
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.Keywords
This publication has 13 references indexed in Scilit:
- The design of POSTGRESACM SIGMOD Record, 1986
- SNAP: A graphics-based schema managerPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- A Switchbox Router with Obstacle AvoidancePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Minimum-Via Topological RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1983
- Hierarchical Wire RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1983
- Methods for Visual Understanding of Hierarchical System StructuresIEEE Transactions on Systems, Man, and Cybernetics, 1981
- Spatial management of dataACM Transactions on Database Systems, 1980
- The entity-relationship model—toward a unified view of dataACM Transactions on Database Systems, 1976
- Query-by-examplePublished by Association for Computing Machinery (ACM) ,1975
- Efficient Planarity TestingJournal of the ACM, 1974