Jump to content

Tarjan's strongly connected components algorithm: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

21 January 2025

12 October 2024

5 July 2024

20 June 2024

4 May 2024

7 April 2024

5 April 2024

19 December 2023

23 November 2023

11 October 2023

4 April 2023

23 February 2023

22 February 2023

21 February 2023

12 December 2022

18 August 2022

3 May 2022

25 February 2022

13 January 2022

16 December 2021

18 August 2021

9 August 2021

29 April 2021

16 November 2020

11 November 2020

1 June 2020

30 May 2020

13 March 2020

  • curprev 23:2223:22, 13 March 2020 79.116.60.55 talk 11,564 bytes +12 Cross-edges clearly need to be considered as per the original paper. The algorithm is correct but the explanation was wrong about the case when w is not on the stack. undo
(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)