Programming with abstract data types, some examples
Pages 646 - 654
Abstract
The data structuring facilities of contemporary languages like Algol-68, Pascal and Simula supports only one type of graphs, the general graph. It is only possible to define the structure of a node in a graph, not to define how the nodes are interrelated. Nothing in the languages prevents the programmer from using for instance a node in a binary tree as an element in a double list. This means that the programmer has to prove a lot of invariants on graphs which would not be necessary if the language supported declarations of different graphs.
This paper contains some examples of algorithms on different graphs. We use a presentation language which is based on Pascal. We have replaced the pointers in Pascal with a set of type constructors. These type constructors give us a possibility to manipulate different graphs in a safe way.
References
[1]
Dijkstra EW: A note on two problems in connexion with graphs. Numerische Matematik 1,269-271 (1959).
[2]
Nordström Bengt: Some concepts for very high level languages without explicit pointers, Ph D thesis. University of Umeá, Sweden.
[3]
Scott D: Data types as lattices, Siam Journal on computing, 5 (1976), pp 522-587
[4]
Scott D: Lattice theory, data types and semantics, NYU Symposium on formal semantics (ed R. Rustin), Prentice Hall, NY (1972)
[5]
Bauer, Eickel (ed): Compiler Construction, an advanced course. Springer Lecture Notes 21, Berlin 1974.
Index Terms
- Programming with abstract data types, some examples
Recommendations
Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
Let $\cal C$ be a family of cliques of a graph G=(V,E). Suppose that each clique C of $\cal C$ is associated with an integer r(C)$, where $r(C) \ge 0$. A vertex v r-dominates a clique C of G if $d(v,x) \le r(C)$ for all $x \in C$, where d(v,x) is the ...
A Characterization of $K_{2,4}$-Minor-Free Graphs
We provide a complete structural characterization of $K_{2,4}$-minor-free graphs. The 3-connected $K_{2,4}$-minor-free graphs consist of nine small graphs on at most eight vertices, together with a family of planar graphs that contains $2n-8$ ...
Comments
Information & Contributors
Information
Published In
January 1978
990 pages
Copyright © 1978 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 January 1978
Check for updates
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 299Total Downloads
- Downloads (Last 12 months)48
- Downloads (Last 6 weeks)13
Reflects downloads up to 10 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in