G/PL/I: Extending PL/I for Graph Processing
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.
KeywordsActual Element STAC
Unable to display preview. Download preview PDF.
- 2.W. Rheinboldt., On a Programming Language for Graph Algorithms, Tech. Rep. TR-158, Univ. of Maryland (1971).Google Scholar
- 4.S. Chase, Analysis of Algorithms for Finding all Spanning Trees of a Graph,Tech. Rep.401, Univ. of Illinois (1970).Google Scholar
- 5.F. Harary,Graph Theory, Addison-Wesley (1969).Google Scholar
- 6.D. Corneil., Private communication.Google Scholar
- 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.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.C. King, A GraphTheoretic Programming Language, Ph.D. Diss., Univ. of West Indies (1970).Google Scholar
- 10.D. Corneil,An Algorithm for Determining the Automorphism Partitioning of an Undirected Graph, Working Paper, Univ. of Toronto.Google Scholar
- 11.R. Tarjan,Depth-First Search and Linear Algorithms, Working Paper, Stanford Univ.Google Scholar