A general-purpose browser for directed graphs is described. The browser provides operations to examine and edit graphs. An operation is also provided 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 or a database design tool). These facilities and our experiences building a program call-graph browser are described.
Title
A Browser for Directed Graphs
Published
Computer Science Division, University of California at Berkeley, Berkeley, California, March 25, 1986
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
CSD-86-292
Type
Text
Extent
23 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
