Tarjan’s algorithm for the computation of the maximal strong components in a directed graph is presented. The presentation is compared to some older ones. key words: program presentation, Tarjan’s algorithm, maximal strong components.
|Title of host publication||Beauty is our business : a birthday salute to Edsger W. Dijkstra|
|Editors||W.H.J. Feijen, A.J.M. Gasteren, van, D. Gries, J. Misra|
|Place of Publication||Berlin|
|Publication status||Published - 1990|
|Name||Texts and monographs in computer science|