SetTopSort

This structure provides topological sorting based on a successor relation on sets.

Signature of SetTopSort

List of Import References :
See BOOL
See DENOTATION
See Nat
See Option
See Seq
See Set

SIGNATURE SetTopSort[data,<]

$Date: 2010-09-30 18:24:17 +0200 (Do, 30. Sep 2010) $ ($Revision: 616 $)

SORT data
FUN  < : data ** data -> bool

IMPORT  Set[data,<]             ONLY set
        Seq[set[data,<]]        ONLY seq
        

topSort(Succs)(Set) computes a topological order of the elements from Set according to the successor relation represented by Succs. Succs must be closed under Set. The resulting sequence is sorted bottom-up according to the successor relation. Cycles are treated by ignoring arcs which point `backwards' according to the successor relation.

FUN topSort : (data -> set[data,<]) -> set[data,<] -> seq[set[data,<]]

next node: MaxStrongComp,
prev node: MaxStrongComp,
up to node: Subsystem Algorithms