Abstract
One of the pleasures of learning computer science is to discover beautiful algorithms. In this chapter we explore an algorithm scheme with several claims to our attention: it is useful in many practical cases; it has a simple mathematical basis; it is particularly elegant; and it illustrates problem-solving techniques that you will find applicable in many other contexts.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Meyer, B. (2013). Devising and engineering an algorithm: Topological Sort. In: Touch of Class. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92145-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-92145-5_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92144-8
Online ISBN: 978-3-540-92145-5
eBook Packages: Computer ScienceComputer Science (R0)