Advertisement

G/PL/I: Extending PL/I for Graph Processing

  • C. Saraiva dos Santos
  • A. L. Furtado

Abstract

G/PL/I extends PL/I to handle both directed and undirected graphs, which may be multigraphs. An arbitrary number of attribute-value pairs can be associated with the graph itself and with its nodes and edges. Special kinds of sets together with set-theoretic operations are provided. The implementation uses preprocessing. It consists of a supervisor and modules for several extensions to PL/I, G/PL/I being one of them.

Keywords

Complete Graph Undirected Graph Chromatic Number Character String Graph Element 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    T. Pratt and D. Friedman, A Language Extension for Graph Processing and its Formal Semantics,Commun. ACM 14, 460–467 (1971).CrossRefGoogle Scholar
  2. 2.
    W. Rheinboldt., On a Programming Language for Graph Algorithms, Tech. Rep. TR-158, Univ. of Maryland (1971).Google Scholar
  3. 3.
    S. Crespi-Reghizzi and S. Morpurgo, A Language for Treating Graphs,Commun. ACM 13, 319–323 (1970).CrossRefGoogle Scholar
  4. 4.
    S. Chase, Analysis of Algorithms for Finding all Spanning Trees of a Graph,Tech. Rep.401, Univ. of Illinois (1970).Google Scholar
  5. 5.
    F. Harary,Graph Theory, Addison-Wesley (1969).Google Scholar
  6. 6.
    D. Corneil., Private communication.Google Scholar
  7. 7.
    C. Christensen, An Example of the Manipulation of Directed Graphs in the AMBIT/G Programming Language, inInteractive Systems for Experimental Applied Mathematics, Klerer and Reinfelds., Academic Press (1969).Google Scholar
  8. 8.
    C. Christensen, An Introduction to AMBIT/L, a Diagrammatic Language for List Processing, inProc. 2nd Symp. on Symbolic and Algebraic Manipulation(1971).Google Scholar
  9. 9.
    C. King, A GraphTheoretic Programming Language, Ph.D. Diss., Univ. of West Indies (1970).Google Scholar
  10. 10.
    D. Corneil,An Algorithm for Determining the Automorphism Partitioning of an Undirected Graph, Working Paper, Univ. of Toronto.Google Scholar
  11. 11.
    R. Tarjan,Depth-First Search and Linear Algorithms, Working Paper, Stanford Univ.Google Scholar

Copyright information

© Plenum Press, New York 1974

Authors and Affiliations

  • C. Saraiva dos Santos
    • 1
  • A. L. Furtado
    • 1
  1. 1.Pontificia Universidade CatolicaRio de JaneiroBrasil

Personalised recommendations