653:
643:
622:
247:
1070:(if the step 5 selected any other node, it would not be true). I feel the insight of "this is the last time we are seeing this node" is helpful though, so I wouldn't remove it, but it would be helpful to admit, that this claim has not yet been justified, and point at where it will be justified, like I tried to do with 'see next step'. Otherwise the reader like me would stop and think they didn't understand something earlier. My new idea is, since @
829:
378:
748:
727:
301:
280:
207:
238:
898:
1164:
I noticed that you still left no explicit information about justifies the 'finality', which I feel still can be helpful, and I interpret your "With this structure, you could justify the points you made in step 4 much more concisely" as allowing me to add the justification onto the new structure, so I
984:
Other than this, first thought I had when I saw how that section is written was that maybe that text should go to the 'Simple
English' language version of the article (could even give a link to there, above the Plain English 'Algorithm', to make it discoverable). But I can see that version does have
1095:
It's important to note that this section is supposed to be a description of the algorithm, not a full fledged proof, so points which are justified inline with the algorithm should be brief. I think that the explanations you've written are a little too long. I understand your concern that the claim
980:
Your impression about it being redundant seem justified to me, but I am not very experienced about what should or shouldn't be in an article. For what it's worth, I myself have never read the description when I came to this article to refresh my understanding - going straight to the
Algorithm was
946:
and even tells you to use a pencil and follow along. Aside from that, it's just a complete restatement of the 'Algorithm' section, except in the context of city roads, jargon removed. It is of course necessary to provide an explanation that can be understood by the general reader, but this is
399:
1057:
The point 4 and 5 have a bit of a circular dependency which I will show below. Having said that, overall, I still think it's good that they are two separate points, because each information they give provides a new useful insight, but I see just one last fixable problem.
1121:
Your suggestions sound sensible to me. (Indeed I was trying to limit myself in the number of points changed, concerned that this would spark contention from many contributors that I would not be able to address, but collaboratively a change like this could be
1103:
To better approximate the actual algorithm, would you suggest rewriting Step 3 to be on the lines of "Select the unvisited node with the smallest distance to be the current node", remove the sentence from Step 2, and make Step 5 simply say "Go back to Step
1065:
does not yet follow from what the reader has read so far, especially that so far the reader does not know yet that there is going to be a loop, and how the 'current node' will change. It is only true thanks to the 5th point having
1099:
Currently, Step 2 says "Set the current node to be the starting node", Step 3 deals with the current node – "For the current node...", and Step 5 deals with the selection of the next node – "select the one with the smallest known
153:
1010:
I quite like the idea of incorporating it into simple
English; I think the SE article would benefit from the terminology used here: place, road, map. I've not written a simple English before but it is possible.
423:
981:
sufficient, which adds to the redundancy vote, though I am a programmer - perhaps the
Algorithm section isn't understandable to all, so maybe waiting for another voice here would make sense.
709:
1133:", just to make it easy to think about how the algorithm first engages the state, yet reaffirm that this is a universal instruction that handles all cases. Will leave it up to you though.
1231:
563:
147:
480:
418:
198:
1246:
351:
341:
1221:
1251:
1236:
44:
1050:(Note that this is quite a fine detail of style, so probably not of big interest to most, but my edits were reverted, which suggest it had some importance to
251:
1271:
796:
317:
1261:
1241:
806:
699:
525:
79:
1107:
With this structure, you could justify the points you made in step 4 much more concisely, rather than long proof sketches which refer to the next step.
1216:
1226:
499:
1147:
Yes, this is what I had in mind for Step 2. I've incorporated it into the article; feel free to copyedit or point out any other issues with it.
1096:"final and minimal" is only justified in the next step; perhaps the earlier steps should deal with written to match the pseudocode more closely?
675:
364:
308:
285:
1256:
588:
85:
1125:
Perhaps I would still add something like I wrote in bold here: "Select the unvisited node with the smallest distance to be the current node
850:
845:
772:
194:
190:
1007:. If binary search, undoubtedly much simpler than Dijkstra, doesn't need a real-life example, I don't think this article needs it either.
1266:
471:
1165:
did so already, to cut the conversation short. If you feel strongly that the reader should deduce this themselves, feel free to undo.
168:
666:
627:
452:
135:
1276:
1211:
755:
732:
544:
99:
30:
104:
20:
74:
509:
390:
260:
129:
883:
519:
433:
65:
1074:
points out it's not clear what aspect of step 5 is highlighted, that maybe it should explicitly state something like
554:
316:
related articles on
Knowledge. If you would like to participate, please visit the project page, where you can join
206:
185:
125:
581:
862:
217:
924:
175:
1000:
109:
1087:
768:
914:
490:
266:
24:
652:
237:
141:
161:
55:
771:
on
Knowledge. If you would like to participate, please visit the project page, where you can join
674:
on
Knowledge. If you would like to participate, please visit the project page, where you can join
1166:
1134:
1079:
986:
963:
868:
658:
222:
70:
966:, since you're here, do you have any thoughts about what to do with this 'Description' section?
642:
621:
1184:
1152:
1112:
1016:
971:
952:
910:
409:
51:
1170:
1138:
1083:
990:
939:
864:
828:
461:
313:
219:
1046:'s request to clarify why I feel that point 4 should refer reader to an aspect of point 5.
1076:"(see next steps where the choice of next 'current node' always picks smallest distance)"
535:
377:
400:
Requested articles/Applied arts and sciences/Computer science, computing, and
Internet
1205:
943:
1180:
1148:
1108:
1071:
1051:
1039:
1012:
967:
948:
917:. For the contribution history and old versions of the redirected page, please see
1188:
1174:
1156:
1142:
1116:
1020:
994:
975:
956:
866:
671:
221:
747:
726:
648:
764:
442:
300:
279:
760:
1004:
985:
a similarly ill-styled text in its
Algorithm section already 🙂
1003:
is the only featured article for an algorithm, and it follows
892:
869:
822:
518:
Find pictures for the biographies of computer scientists (see
231:
223:
15:
938:
The section currently titled 'description' reads more like a
1063:"distance recorded on the current node is final and minimal"
1043:
919:
905:
160:
759:, a collaborative effort to improve the coverage of
670:, a collaborative effort to improve the coverage of
312:, a collaborative effort to improve the coverage of
424:Computer science articles needing expert attention
1068:"select the one with the smallest known distance"
33:for general discussion of the article's subject.
1232:Knowledge level-5 vital articles in Mathematics
1179:Your explanation looks fine to me. Thank you.
1127:(on the first entry to this step, this is the
564:WikiProject Computer science/Unreferenced BLPs
942:on how to run Dijkstra by hand. It's full of
877:This page has archives. Sections older than
174:
8:
923:; for the discussion at that location, see
481:Computer science articles without infoboxes
419:Computer science articles needing attention
721:
616:
385:Here are some tasks awaiting attention:
359:
274:
1247:Top-importance Computer science articles
1222:Knowledge vital articles in Mathematics
723:
618:
276:
235:
887:when more than 4 sections are present.
326:Knowledge:WikiProject Computer science
1252:WikiProject Computer science articles
1237:C-Class vital articles in Mathematics
329:Template:WikiProject Computer science
7:
947:redundant and not the way to do it.
753:This article is within the scope of
664:This article is within the scope of
306:This article is within the scope of
1089:_claim_of_'final_and_minimal'": -->
265:It is of interest to the following
23:for discussing improvements to the
1272:High-importance Computing articles
500:Timeline of computing 2020–present
14:
1262:Mid-priority mathematics articles
1242:C-Class Computer science articles
881:may be automatically archived by
684:Knowledge:WikiProject Mathematics
526:Computing articles needing images
1217:Knowledge level-5 vital articles
1088:_Pt._4_(marking_a_visited)_: -->
1030:
896:
827:
746:
725:
687:Template:WikiProject Mathematics
651:
641:
620:
376:
299:
278:
245:
236:
205:
45:Click here to start a new topic.
1161:Thank you. The copy looks good.
1032:Pt. 4 (marking a visited) : -->
801:This article has been rated as
781:Knowledge:WikiProject Computing
704:This article has been rated as
346:This article has been rated as
1227:C-Class level-5 vital articles
784:Template:WikiProject Computing
1:
775:and see a list of open tasks.
678:and see a list of open tasks.
580:Tag all relevant articles in
320:and see a list of open tasks.
42:Put new text under old text.
1257:C-Class mathematics articles
1033:claim of 'final and minimal'
589:WikiProject Computer science
365:WikiProject Computer science
309:WikiProject Computer science
520:List of computer scientists
50:New to Knowledge? Welcome!
1293:
1267:C-Class Computing articles
957:22:33, 26 April 2024 (UTC)
934:Description section issues
807:project's importance scale
352:project's importance scale
800:
741:
703:
636:
582:Category:Computer science
358:
345:
332:Computer science articles
294:
273:
80:Be welcoming to newcomers
1189:15:27, 29 May 2024 (UTC)
1175:15:16, 29 May 2024 (UTC)
1157:14:10, 29 May 2024 (UTC)
1143:13:35, 29 May 2024 (UTC)
1117:12:46, 29 May 2024 (UTC)
1090:12:30, 29 May 2024 (UTC)
1038:Context: Responding to @
1021:01:27, 30 May 2024 (UTC)
995:00:39, 30 May 2024 (UTC)
976:15:37, 29 May 2024 (UTC)
710:project's priority scale
584:and sub-categories with
1001:Binary search algorithm
667:WikiProject Mathematics
1277:All Computing articles
1212:C-Class vital articles
884:Lowercase sigmabot III
769:information technology
545:Computer science stubs
75:avoid personal attacks
1061:Namely, the claim of
903:The contents of the
756:WikiProject Computing
252:level-5 vital article
199:Auto-archiving period
100:Neutral point of view
915:Dijkstra's algorithm
690:mathematics articles
363:Things you can help
105:No original research
25:Dijkstra's algorithm
906:Uniform-cost search
999:From what I know,
787:Computing articles
659:Mathematics portal
261:content assessment
86:dispute resolution
47:
1131:of distance zero)
931:
930:
891:
890:
856:
855:
821:
820:
817:
816:
813:
812:
720:
719:
716:
715:
615:
614:
611:
610:
607:
606:
603:
602:
230:
229:
66:Assume good faith
43:
1284:
922:
900:
899:
893:
886:
870:
842:
841:
831:
823:
789:
788:
785:
782:
779:
750:
743:
742:
737:
729:
722:
692:
691:
688:
685:
682:
661:
656:
655:
645:
638:
637:
632:
624:
617:
593:
587:
462:Computer science
391:Article requests
380:
373:
372:
360:
334:
333:
330:
327:
324:
323:Computer science
314:Computer science
303:
296:
295:
290:
286:Computer science
282:
275:
258:
249:
248:
241:
240:
232:
224:
210:
209:
200:
179:
178:
164:
95:Article policies
16:
1292:
1291:
1287:
1286:
1285:
1283:
1282:
1281:
1202:
1201:
1035:
1031:Algorithm : -->
936:
918:
897:
882:
871:
865:
836:
803:High-importance
786:
783:
780:
777:
776:
736:High‑importance
735:
689:
686:
683:
680:
679:
657:
650:
630:
599:
596:
591:
585:
573:Project-related
568:
549:
530:
504:
485:
466:
447:
428:
404:
331:
328:
325:
322:
321:
288:
259:on Knowledge's
256:
246:
226:
225:
220:
197:
121:
116:
115:
114:
91:
61:
12:
11:
5:
1290:
1288:
1280:
1279:
1274:
1269:
1264:
1259:
1254:
1249:
1244:
1239:
1234:
1229:
1224:
1219:
1214:
1204:
1203:
1200:
1199:
1198:
1197:
1196:
1195:
1194:
1193:
1192:
1191:
1162:
1123:
1105:
1101:
1097:
1034:
1029:
1028:
1027:
1026:
1025:
1024:
1023:
1008:
982:
935:
932:
929:
928:
901:
889:
888:
876:
873:
872:
867:
863:
861:
858:
857:
854:
853:
848:
838:
837:
832:
826:
819:
818:
815:
814:
811:
810:
799:
793:
792:
790:
773:the discussion
751:
739:
738:
730:
718:
717:
714:
713:
702:
696:
695:
693:
676:the discussion
663:
662:
646:
634:
633:
625:
613:
612:
609:
608:
605:
604:
601:
600:
598:
597:
595:
594:
577:
569:
567:
566:
560:
550:
548:
547:
541:
531:
529:
528:
523:
515:
505:
503:
502:
496:
486:
484:
483:
477:
467:
465:
464:
458:
448:
446:
445:
439:
429:
427:
426:
421:
415:
405:
403:
402:
396:
384:
382:
381:
369:
368:
356:
355:
348:Top-importance
344:
338:
337:
335:
318:the discussion
304:
292:
291:
289:Top‑importance
283:
271:
270:
264:
242:
228:
227:
218:
216:
215:
212:
211:
181:
180:
118:
117:
113:
112:
107:
102:
93:
92:
90:
89:
82:
77:
68:
62:
60:
59:
48:
39:
38:
35:
34:
28:
13:
10:
9:
6:
4:
3:
2:
1289:
1278:
1275:
1273:
1270:
1268:
1265:
1263:
1260:
1258:
1255:
1253:
1250:
1248:
1245:
1243:
1240:
1238:
1235:
1233:
1230:
1228:
1225:
1223:
1220:
1218:
1215:
1213:
1210:
1209:
1207:
1190:
1186:
1182:
1178:
1177:
1176:
1172:
1168:
1163:
1160:
1159:
1158:
1154:
1150:
1146:
1145:
1144:
1140:
1136:
1132:
1130:
1129:starting node
1124:
1120:
1119:
1118:
1114:
1110:
1106:
1102:
1098:
1094:
1093:
1092:
1091:
1085:
1081:
1077:
1073:
1069:
1064:
1059:
1055:
1053:
1048:
1047:
1045:
1041:
1022:
1018:
1014:
1009:
1006:
1002:
998:
997:
996:
992:
988:
983:
979:
978:
977:
973:
969:
965:
961:
960:
959:
958:
954:
950:
945:
944:second person
941:
933:
926:
925:its talk page
921:
916:
912:
908:
907:
902:
895:
894:
885:
880:
875:
874:
860:
859:
852:
849:
847:
844:
843:
840:
839:
835:
830:
825:
824:
808:
804:
798:
795:
794:
791:
774:
770:
766:
762:
758:
757:
752:
749:
745:
744:
740:
734:
731:
728:
724:
711:
707:
701:
698:
697:
694:
677:
673:
669:
668:
660:
654:
649:
647:
644:
640:
639:
635:
629:
626:
623:
619:
590:
583:
579:
578:
576:
574:
570:
565:
562:
561:
559:
557:
556:
551:
546:
543:
542:
540:
538:
537:
532:
527:
524:
521:
517:
516:
514:
512:
511:
506:
501:
498:
497:
495:
493:
492:
487:
482:
479:
478:
476:
474:
473:
468:
463:
460:
459:
457:
455:
454:
449:
444:
441:
440:
438:
436:
435:
430:
425:
422:
420:
417:
416:
414:
412:
411:
406:
401:
398:
397:
395:
393:
392:
387:
386:
383:
379:
375:
374:
371:
370:
366:
362:
361:
357:
353:
349:
343:
340:
339:
336:
319:
315:
311:
310:
305:
302:
298:
297:
293:
287:
284:
281:
277:
272:
268:
262:
254:
253:
243:
239:
234:
233:
214:
213:
208:
204:
196:
192:
189:
187:
183:
182:
177:
173:
170:
167:
163:
159:
155:
152:
149:
146:
143:
140:
137:
134:
131:
127:
124:
123:Find sources:
120:
119:
111:
110:Verifiability
108:
106:
103:
101:
98:
97:
96:
87:
83:
81:
78:
76:
72:
69:
67:
64:
63:
57:
53:
52:Learn to edit
49:
46:
41:
40:
37:
36:
32:
26:
22:
18:
17:
1128:
1126:
1075:
1067:
1062:
1060:
1056:
1049:
1037:
1036:
937:
904:
878:
833:
802:
754:
706:Mid-priority
705:
665:
631:Mid‑priority
572:
571:
555:Unreferenced
553:
552:
534:
533:
508:
507:
489:
488:
470:
469:
451:
450:
432:
431:
408:
407:
389:
388:
347:
307:
267:WikiProjects
250:
202:
184:
171:
165:
157:
150:
144:
138:
132:
122:
94:
19:This is the
920:its history
681:Mathematics
672:mathematics
628:Mathematics
148:free images
31:not a forum
1206:Categories
1100:distance".
909:page were
851:Archive 2
846:Archive 1
778:Computing
765:computing
761:computers
733:Computing
443:Computing
255:is rated
88:if needed
71:Be polite
21:talk page
1122:viable.)
940:tutorial
879:365 days
834:Archives
491:Maintain
434:Copyedit
203:365Â days
186:Archives
56:get help
29:This is
27:article.
1181:IntGrah
1149:IntGrah
1109:IntGrah
1072:IntGrah
1052:IntGrah
1040:IntGrah
1013:IntGrah
968:IntGrah
949:IntGrah
805:on the
708:on the
472:Infobox
410:Cleanup
350:on the
257:C-class
154:WPÂ refs
142:scholar
1167:Zlamma
1135:Zlamma
1080:Zlamma
1005:MOS:CS
987:Zlamma
964:Zlamma
911:merged
767:, and
453:Expand
263:scale.
126:Google
913:into
536:Stubs
510:Photo
367:with:
244:This
169:JSTOR
130:books
84:Seek
1185:talk
1171:talk
1153:talk
1139:talk
1113:talk
1084:talk
1044:edit
1017:talk
991:talk
972:talk
953:talk
797:High
162:FENS
136:news
73:and
1104:3"?
1054:).
1042:'s
700:Mid
342:Top
176:TWL
1208::
1187:)
1173:)
1155:)
1141:)
1115:)
1086:)
1078:.
1019:)
993:)
974:)
955:)
763:,
592:}}
586:{{
201::
193:,
156:)
54:;
1183:(
1169:(
1151:(
1137:(
1111:(
1082:(
1015:(
989:(
970:(
962:@
951:(
927:.
809:.
712:.
575::
558::
539::
522:)
513::
494::
475::
456::
437::
413::
394::
354:.
269::
195:2
191:1
188::
172:·
166:·
158:·
151:·
145:·
139:·
133:·
128:(
58:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
