Class DS_TOPOLOGICAL_SORTER

-- Create a new topological sorter.
-- Set initial capacity to nb.

-- Create a new topological sorter.
-- Set initial capacity to a default value.

-- Items involved in a cycle if any
-- (Note: the items in cycle are stored in reverse order
-- and the first item is repeated at the end of the list.)

-- Equality tester to compare items to be sorted;
-- A void equality tester means that = will be
-- used as comparison criterion.

-- Index of v in the list of items to be sorted;
-- Return 'count + 1' if v is not in the list yet

-- Sorted items

-- Maximum number of items to be sorted

-- Number of items to be sorted

-- Can set_equality_tester be called with a_tester
-- as argument in current state of the sorter?

-- Is v included in the list of items to be sorted?

-- Has a cycle been detected?

-- Are there no items yet to be sorted?

-- Have items been sorted?

-- Add v to the list of items to be sorted.
-- Resize the list of items if needed.

-- Specify that item u should appear
-- before item v in the sorted list.
-- Insert u and v in the list of items
-- to be sorted if not already done.

-- Add v to the list of items to be sorted.

-- Specify that item at index i should
-- appear before item at index j in
-- the sorted list.

-- Specify that item u should appear
-- before item v in the sorted list.

-- Remove v to the list of items to be sorted.
-- Keep the order relation for the sorting though.

-- Discard result of last sort.

-- Wipe out items.

-- Set equality_tester to a_tester.
-- A void equality tester means that =
-- will be used as comparison criterion.

-- Sort items held in items according to the
-- relations which have been recorded.