Dijkstra's algorithm: Revision history

Filter revisionsshowhide

To date:

Tag filter:

Invert selection

External tools:

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

curprev 23:4023:40, 30 May 2004 Brona talk contribs 5,816 bytes +460 →Description of the algorithm: mention relaxation undo

curprev 21:3721:37, 12 May 2004 142.103.14.217 talk 5,356 bytes +6 TSP is NP-complete, which is a more precise notion than NP-hard undo

curprev 22:4622:46, 6 May 2004 Brona talk contribs m 5,350 bytes −3 corrected markup undo
curprev 18:2618:26, 6 May 2004 Altenmann talk contribs m 5,353 bytes +63 [[]] undo

curprev 09:5109:51, 3 May 2004 Matusz talk contribs 5,290 bytes +32 pl: undo

curprev 20:3620:36, 2 May 2004 Brona talk contribs 5,258 bytes +133 =References= add an external link undo
curprev 01:3301:33, 2 May 2004 Brona talk contribs m 5,125 bytes +19 fix link and typo undo

curprev 00:3800:38, 22 April 2004 Brona talk contribs 4,374 bytes +10 Fibonacci heap needed to achievementioned running time undo
curprev 00:2300:23, 22 April 2004 Brona talk contribs 4,364 bytes +58 =References= expand the reference undo

curprev 03:5803:58, 21 April 2004 Csurguine talk contribs m 4,306 bytes +62 No edit summary undo

curprev 18:3718:37, 29 February 2004 Robert Southworth talk contribs m 4,244 bytes −2 vertexes -> vertices; closed bracket because infty is a permitted value undo

curprev 21:4121:41, 20 February 2004 Decrypt3 talk contribs m 4,246 bytes 0 must have open-interval bracket for infinity undo

curprev 09:0409:04, 5 February 2004 Dysprosia talk contribs m 4,246 bytes +30 disambig link, doesn't link properly undo
curprev 08:5808:58, 5 February 2004 Charles Matthews talk contribs m 4,216 bytes +2 No edit summary undo

curprev 10:4110:41, 24 January 2004 Owen talk contribs m 4,214 bytes 0 vertexes->vertices undo

curprev 16:5016:50, 3 December 2003 Hashar talk contribs m 4,214 bytes +2 robot Modifying:de undo

curprev 13:3613:36, 20 November 2003 218.41.203.246 talk 4,212 bytes +67 +ja undo

curprev 21:0221:02, 28 August 2003 62.147.198.222 talk 4,145 bytes +31 link fr undo

curprev 11:5511:55, 8 July 2003 Css talk contribs m 4,114 bytes −29 restore undo
curprev 11:4311:43, 8 July 2003 202.138.177.17 talk 4,143 bytes +29 No edit summary undo

curprev 19:3819:38, 23 June 2003 81.77.15.69 talk 4,114 bytes +334 Minor tweaks, inserted subscripts undo

curprev 22:2922:29, 14 April 2003 195.137.39.195 talk 3,780 bytes +1 correct typo undo
curprev 22:2722:27, 14 April 2003 195.137.39.195 talk 3,779 bytes +789 hint at proof ... undo

curprev 11:0511:05, 2 February 2003 Nixdorf talk contribs m 2,990 bytes +47 +seealso undo

curprev 05:5005:50, 6 January 2003 Someone else talk contribs 2,943 bytes −1 space before ∞ seems to help undo
curprev 05:4405:44, 6 January 2003 203.202.5.75 talk 2,944 bytes +2 Had to correct further - infinity symbol does not appear as intended undo
curprev 05:3205:32, 6 January 2003 66.125.224.184 talk m 2,942 bytes +5 fix infinity undo

curprev 17:3217:32, 12 December 2002 80.132.139.148 talk m 2,937 bytes +29 de: undo

curprev 05:3605:36, 11 August 2002 213.253.39.2 talk 2,908 bytes −65 <b>Dijkstra's algorithm</b>, named after its inventor the Dutch computer scientist Edsger Dijkstra, undo
curprev 05:3505:35, 11 August 2002 213.253.39.2 talk 2,973 bytes +47 <b>Dijkstra's algorithm</b>, named after its inventor Edsger Dijkstra, s undo

curprev 14:1914:19, 9 August 2002 LC~enwiki talk contribs m 2,926 bytes −4 No edit summary undo
curprev 14:1414:14, 9 August 2002 LC~enwiki talk contribs 2,930 bytes +313 mention traveling salesman problem undo

curprev 03:1703:17, 2 August 2002 217.168.172.203 talk m 2,617 bytes −1 No edit summary undo

curprev 13:3213:32, 1 June 2002 LC~enwiki talk contribs 2,618 bytes +4 No edit summary undo
curprev 13:2013:20, 1 June 2002 LC~enwiki talk contribs m 2,614 bytes 0 No edit summary undo
curprev 04:3904:39, 1 June 2002 217.228.165.227 talk 2,614 bytes +15 No edit summary undo

curprev 11:1111:11, 14 April 2002 Shd~enwiki talk contribs m 2,599 bytes +45 No edit summary undo

curprev 15:5215:52, 24 March 2002 AxelBoldt talk contribs 2,554 bytes +176 more precise run time statement undo
curprev 15:1515:15, 24 March 2002 AxelBoldt talk contribs m 2,378 bytes +130 new title, copyedit, time complexity undo
curprev 14:3714:37, 24 March 2002 Css talk contribs m 2,248 bytes +82 move link to Edsger Dijkstra undo
curprev 14:2114:21, 24 March 2002 Shd~enwiki talk contribs m 2,166 bytes +7 Linked to Edsger Dijsktra and Shorttest path problem undo

curprev 15:4715:47, 8 March 2002 62.188.54.65 talk 2,159 bytes +104 add OSPF as an example undo

curprev 11:4111:41, 1 March 2002 Shd~enwiki talk contribs m 2,055 bytes +2,055 No edit summary

Dijkstra's algorithm: Revision history

30 May 2004

12 May 2004

6 May 2004

3 May 2004

2 May 2004

30 April 2004

22 April 2004

21 April 2004

29 February 2004

20 February 2004

5 February 2004

24 January 2004

3 December 2003

20 November 2003

28 August 2003

8 July 2003

23 June 2003

14 April 2003

2 February 2003

6 January 2003

12 December 2002

11 August 2002

9 August 2002

2 August 2002

1 June 2002

14 April 2002

24 March 2002

8 March 2002

1 March 2002