Topological sorting

It’s convenient to describe a data structure in terms of the operations performed, rather than in terms of implementation details. That means we should separate the concepts from particular implementations. When a data structure is defined that way, it’s called an abstract data type (ADT).

124p janeeyre_thanh 12-08-2013 80 16   Download