Abstract
In this chapter we shall develop some basic algorithms for directed graphs and relations which will be of use in later chapters, where the efficient construction of parsers is considered. The constructions needed can be expressed as the computing of certain “relational expressions”. These are expressions whose operands are relations and whose operators are chosen from among multiplication, closure, union and inverse. For this purpose we need to develop an algorithm for computing the closure of a relation. In view of the nature of our applications, the most appropriate way to do this is by a depth-first traversal of the graph that corresponds to the given relation. Other ways of computing the closure of a relation are considered in the exercises.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Sippu, S., Soisalon-Soininen, E. (1988). Algorithms on Graphs. In: Parsing Theory. EATCS Monographs on Theoretical Computer Science, vol 15. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61345-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-61345-6_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64801-4
Online ISBN: 978-3-642-61345-6
eBook Packages: Springer Book Archive