An algorithm for hierarchical reduction and decomposition of a directed graph

With the algorithm described, it is possible to decompose a directed graph without loops and cycles into subgraphs which have one and only one source, one and only one sink and no other connections to the complement of the subgraph. The algorithm delivers all subgraphs with this property and the hierarchical structure of these subgraphs. Examples and some experiences on computing time are given.