Skip to main content
SpringerLink
Log in
Book cover

Algorithms Unplugged pp 39–45Cite as

Topological Sorting - How Should I Begin to Complete My To Do List?

  • Chapter

  • 12k Accesses

Abstract

In this chapter the author presents a method for topological sorting. This is needed when there is a sequence of jobs that depend on each other – for example, job A must be executed before job B can start. The goal of topological sorting in this case is to come up with an order of the jobs so that they can be executed one after the other without violating any dependencies between two jobs.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   119.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

  1. Bauhaus-Universität Weimar, Weimar, Germany

    Hagen Höpfner

Authors
  1. Hagen Höpfner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Lehrstuhl für Informatik I, Algorithmen und Komplexität, RWTH Aachen, Ahornstr. 55, Aachen, 52074, Germany

    Berthold Vöcking

  2. Institut für Informatik, Freie Universität Berlin, Takustr. 9, Berlin, 14195, Germany

    Helmut Alt

  3. Institut für Theoretische Informatik, Fakultät für Informatik, Technische Universität Ilmenau, Helmholtzplatz 1, Ilmenau, 98693, Germany

    Martin Dietzfelbinger

  4. Institut für Theoretische Informatik, Universität zu Lübeck, Ratzeburger Allee 160, Lübeck, 23538, Germany

    Rüdiger Reischuk

  5. Institut für Informatik, Universität Paderborn, Fürstenallee 11, Paderborn, 33102, Germany

    Christian Scheideler

  6. Institut für Theoretische Informatik, Leibniz Universität Hannover, Appelstr. 4, Hannover, 30167, Germany

    Heribert Vollmer

  7. Institut für Theoretische Informatik, Karlsruhe Institute of Technology (KIT), Am Fasanengarten 5, Karlsruhe, 76131, Germany

    Dorothea Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Höpfner, H. (2011). Topological Sorting - How Should I Begin to Complete My To Do List?. In: Vöcking, B., et al. Algorithms Unplugged. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15328-0_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15327-3

  • Online ISBN: 978-3-642-15328-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation