Jump to content

Tarjan's off-line lowest common ancestors 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)

27 June 2025

26 June 2025

25 October 2024

12 October 2024

10 May 2024

14 August 2023

5 September 2021

6 July 2021

17 April 2020

  • curprev 02:3102:31, 17 April 2020 147.229.208.56 talk 4,278 bytes +31 Undid revision 951222211 by 188.24.109.93. The justification "a line from the pseudocode (…) is redundant, because at that point Find(u) is still equal to u" is not true, cf. the previous line "Union(u, v)" which allows for Find(u) = v. undo Tag: Undo

16 April 2020

4 February 2020

24 December 2019

17 December 2019

31 March 2018

3 February 2018

18 January 2018

8 September 2017

28 July 2017

26 September 2016

26 June 2016

27 September 2015

21 September 2015

30 June 2014

19 June 2014

10 June 2013

22 May 2013

20 May 2013

7 March 2013

1 February 2013

8 December 2011

16 November 2011

20 October 2011

13 March 2011

26 May 2010

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