Other Scholarly Content
 

Topological sorting algorithms

Public Deposited

Downloadable Content

Download PDF
https://ir.library.oregonstate.edu/concern/defaults/0c483t097

Descriptions

Attribute NameValues
Creator
Abstract
  • Topological Sorting is a standard computation performed on finite partial order relations, for which efficient algorithms are well known. This work is a study of using a depth-first search of a directed graph to implement topological sorting algorithms. A new algorithm is presented, along with a discussion of how it compares with known algorithms.
  • 1983 best estimate for issue date based on available information.
Resource Type
Date Issued
Academic Affiliation
Rights Statement
Publisher
Peer Reviewed
Language

Relationships

Parents:

This work has no parents.

Items