DAG—a program that draws directed graphs

@article{Vo1988DAGaPT,
  title={DAG—a program that draws directed graphs},
  author={K. P. Vo},
  journal={Software: Practice and Experience},
  year={1988},
  volume={18}
}
  • K. P. Vo
  • Published 1988
  • Computer Science
  • Software: Practice and Experience
  • DAG is a program that draws directed graphs by reading a list of noeds and edges, computing a layout and then writing a PIC or PostScript description of a picture. Optional drawing instructions specify the way nodes are drawn, attach labels and control spacing. DAG works best on directed acyclic graphs, which are often used to represent hierarchical relationships. For example, here is a drawing of a graph from J. W. Forrester's book, World Dynamics (Wright‐Allen, Cambridge, MA, 1971), which… CONTINUE READING
    168 Citations

    Topics from this paper

    Cluster busting in anchored graph drawing
    • 43
    Dagger: A Tool to Generate Program Graphs
    • Y. Chen
    • Computer Science
    • USENIX Applications Development Symposium
    • 1994
    • 3
    Using graph parsing for automatic graph drawing
    • 17
    • PDF
    A New Heuristic Layout Algorithm for DAGs
    • 19
    Algorithms for Drawing Graphs: an Annotated Bibliography
    • 1,021
    • PDF
    A Graph Model which Supports Flexible Layout
    • 11
    Directed Graphs by Clan-Based Decomposition
    • 11
    • PDF
    Drawing Directed Acyclic Graphs: An Experimental Study
    • 17
    • PDF

    References

    SHOWING 1-9 OF 9 REFERENCES
    A browser for directed graphs
    • 147
    • PDF
    PIC — A language for typesetting graphics
    • 53
    Methods for Visual Understanding of Hierarchical System Structures
    • 1,235
    • PDF
    PostScript Language Reference Manual
    • 222
    Heuristics for Drawing 2-Layered Networks
    • ARS Combinatoria
    • 1986
    Adobe Systems. Postscript Language Reference Manual
    • Adobe Systems. Postscript Language Reference Manual
    • 1985
    An NP-Complete Crossing Number Problem for Bipartite Graphs
    • An NP-Complete Crossing Number Problem for Bipartite Graphs
    • 1985
    IX. References
    • 1971
    • 608