Related changes
Enter a page name to see changes on pages linked to or from that page. (To see members of a category, enter Category:Name of category). Changes to pages on your Watchlist are shown in bold with a green bullet. See more at Help:Related changes.
List of abbreviations (help):
- D
- Edit made at Wikidata
- r
- Edit flagged by ORES
- N
- New page
- m
- Minor edit
- b
- Bot edit
- (±123)
- Page byte size change
- Temporarily watched page
9 December 2025
- diffhist Recursion (computer science) 01:14 −6 Msyds talk contribs (Remove implication that languages without primitive loop constructs don't have any high-level looping.)
8 December 2025
- diffhist Bellman–Ford algorithm 18:03 +20 David Eppstein talk contribs (Undid revision 1326337915 by CastleHoney (talk) "slower" is more precise than "less efficient", and the new wording gives the impression the algorithm can handle graphs with all edge weights negative, only true for trees (on which Dijkstra actually does work)) Tag: Undo
- diffhist Module:Navbox 13:59 −24 Pigsonthewing talk contribs (sync per request)
- diffhist m Bellman–Ford algorithm 12:24 −20 CastleHoney talk contribs (Use more precise terms when noting the difference between bellman-ford and dijkstra) Tag: Reverted