Automatic generation produced by ISE Eiffel
class TOPOLOGICAL_SORTER [G -> HASHABLE] General cluster: base_extension description: "Topological sorter. Used to produce a total order on a set of elements having only a partial order." create: make Ancestors ANY Queries count: INTEGER_32 cycle_found: BOOLEAN cycle_list: LIST [G] done: BOOLEAN fifo_output: BOOLEAN has_element (e: G): BOOLEAN object_comparison: BOOLEAN sorted_elements: LIST [G] Commands compare_objects compare_references process record_constraint (e, f: G) record_element (e: G) reset use_fifo_output use_lifo_output Constraints element count predecessor list count successor list count cycle list iff cycle all items sorted no item forgotten processed count -- Generated by Eiffel Studio --
For more details: eiffel.org