Book Chapter10.1016/B978-1-4832-3187-7.50011-8
A graph-theoretic programming language
Clarence King
- 01 Jan 1972
- pp 63-75
7
TL;DR: An attempt has been made to include a wide variety of graph theory routines in GTPL, but it is expected that use of the language will point to the need for additional routines.
read more
Abstract: Publisher Summary This chapter discusses a programming language for graph theory, which is an extension of FORTRAN for handling graphs. The graph-theoretic programming language (GTPL) is described as a dialect of FORTRAN, and for simplicity basic FORTRAN has been used. The assignment statement of GTPL is exactly like that of FORTRAN, although this version of the assignment statement may appear somewhat restrictive, it has proved quite adequate for the purpose for which the language has been designed. In addition to the IF statement of FORTRAN, there is a logical IF statement which is used when testing for certain graph-theoretic properties. An interesting feature of GTPL is the facility to handle collections of graphs. The label that identifies a collection of graphs is prefixed by the character $, and one may refer to the entire collection of graphs or to a particular member of the collection. However, the most important difference between GTPL and FORTRAN lies in the incorporation in GTPL of a number of graph-theoretical statements. The operating system for the programming language consists of a compiler phase and an execution phase. An attempt has been made to include a wide variety of graph theory routines in GTPL, but it is expected that use of the language will point to the need for additional routines.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Tutorial and Bibliographical Survey on Graph Grammars
Manfred Nagl
- 30 Oct 1978
TL;DR: Most of the approaches for sequential and parallel graph grammars known in literature are given and some of the modifications and extensions enforced by several applications are introduced.
124
A key review on graph data science: The power of graphs in scientific studies
TL;DR: A comprehensive review of graph theory, various graph types, and the role of graph visualization in scientific studies is provided in this paper , highlighting the importance of graphs as a visual representation in scientific research, enabling a better understanding of complex data.
17
A graph-theoretic language extension for an interactive computer graphics environment
TL;DR: A programming language extension, AGILE, for the processing of graphs within an interactive computer graphics environment, is defined, which allows one to naturally exploit the underlying graph structure found in a wide class of problems, while a graphics environment permits the elegant display of (and interaction with) such representations.
5
Graphentheoretische Modelle und Methoden
Hartmut Noltemeier
- 01 Jan 1979
TL;DR: Eine Ubersicht uber die Einsatzmoglichkeiten graphentheoretischer Konzepte zur Beschreibung, Analyse and Gestaltung of Informationssystemen kann im Rahmen der gegebenen Zeit nur ausgewahlte Problemkreise herausgreifen.
5
CADTOOLS: A CAD Algorithm Development System
E. Schell,M.R. Mercer +1 more
- 01 Jun 1985
TL;DR: A development system for computer-aided design algorithms for combinational logic networks that includes graph-oriented commands and control structures, list handling facilities, and an expandable library of commonly used CAD subprograms is defined.
3
References
NAPSS—a numerical analysis problem-solving system
John R. Rice,Saul Rosen +1 more
TL;DR: This paper discusses some of the features of the language and system design, and an approach through the development of so-called polyalgorithms to the design of the numerical analysis packages that are the essential elements of the problem solving system.
26
A language for treating graphs
S. Crespi-Reghizzi,R. Morpurgo +1 more
TL;DR: This chapter discusses the development of ALGOL, a simple typeless language which permits functional data structures and coroutines, and its introduction to the COGENT programming system.
22
Formula Manipulation by Computer
TL;DR: The chapter presents a discussion of the main issues in a formula manipulation system, both from language and implementation points of view, and discusses a particular large-scale system—namely, FORMAC.
12
A language and system for symbolic algebra on a digital computer
W. S. Brown
- 01 Jan 1966
TL;DR: The ALPAK system and the ALTRAN language for symbolic algebra on a digital computer is described, specifically designed for the efficient handling of large scale algebraic computations, and has been applied to a wide variety of practical problems.
8