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 ( | ) (20 | 50 | 100 | 250 | 500)

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

10 January 2020

17 December 2019

11 November 2019

5 September 2019

25 July 2019

29 May 2019

26 May 2019

18 March 2019

25 February 2019

24 February 2019

14 January 2019

10 October 2018

24 August 2018

17 June 2018

2 March 2018

19 February 2018

6 January 2018

13 December 2017

4 November 2017

3 October 2017

2 October 2017

21 September 2017

9 May 2017

11 April 2017

7 March 2017

8 February 2017

8 August 2016

25 July 2016

17 July 2016

24 June 2016

15 April 2016

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