Jump to content

Cuthill–McKee 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)

25 October 2024

12 October 2024

21 June 2022

8 June 2022

16 January 2022

13 April 2021

27 February 2021

30 November 2020

  • curprev 20:0820:08, 30 November 2020 Desertrider12 talk contribs 4,305 bytes +338 It's important to say that level sets are sorted by predecessor. The code in the cited blogspot explores the next level one vertex at a time from a queue, so it's not made explicit there. But this code takes R_i all at once and sorts it, so predecessor must be used to compare. The slides I cite make this clearer. undo

16 August 2019

31 May 2018

15 February 2018

8 February 2018

11 July 2017

8 June 2017

17 January 2017

16 January 2017

19 December 2016

31 January 2016

26 November 2015

24 March 2015

30 April 2014

9 June 2013

31 May 2013

28 May 2013

20 April 2013

8 April 2013

7 March 2013

11 February 2013

14 September 2012

5 August 2012

27 July 2012

9 June 2012

1 May 2012

9 February 2012

8 February 2012

12 December 2011

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