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
21 May 2025
- diffhist m Bellman–Ford algorithm 02:30 +2 David Eppstein talk contribs (→Original sources: fix formatting)
- diffhist Bellman–Ford algorithm 02:30 0 David Eppstein talk contribs (→Improvements: use publication date)
- diffhist Bellman–Ford algorithm 02:29 +417 David Eppstein talk contribs (→Original sources: cite conference version, not preprint)
- diffhist Bellman–Ford algorithm 02:27 +10 David Eppstein talk contribs (→Original sources: fix title)
- diffhist Bellman–Ford algorithm 02:26 +99 David Eppstein talk contribs (→Improvements: explain the tilde)
- diffhist m Bellman–Ford algorithm 01:39 +7 VoidPotato talk contribs (Fix Big-O notation error) Tag: Visual edit
19 May 2025
- diffhist Algorithm 01:34 +112 David Eppstein talk contribs (→By design paradigm: improve sourcing for divide & conquer / prune & search)
- diffhist Algorithm 01:25 −35 David Eppstein talk contribs (→Ancient algorithms: the citation is right there in the next sentence)
- diffhist Algorithm 01:21 −177 David Eppstein talk contribs (more precisely locate the quotation from stone; page 8 (end of section), not page 4 (earlier version of similar def))
- diffhist Algorithm 01:12 +1,415 David Eppstein talk contribs (→Etymology: clean up attestations and sourcing)
- diffhist Algorithm 00:39 −28 David Eppstein talk contribs (I don't think this essay-like cleanup banner is valid)
16 May 2025
- diffhist Module:Footnotes/whitelist 22:05 +49 Redrose64 talk contribs (add another entry for CITEREFLohrThielmann1988)
15 May 2025
- diffhist Graph (discrete mathematics) 04:30 −34 David Eppstein talk contribs (Undid revision 1290491005 by Manitofigh (talk) ordered and unordered pairs are a way of representing edges with directions. They are not the only way. For instance, representing a graph as a set of pairs works very badly for mixed graphs and multigraphs and is somewhat cumbersome for graph orientations. for We should keep representation details separate from the basic idea of a graph.) Tag: Undo
- diffhist Graph (discrete mathematics) 03:41 +34 Manitofigh talk contribs Tag: Reverted
14 May 2025
- diffhist m Dijkstra's algorithm 14:13 −29 Ajmullen talk contribs (→Pseudocode: Minor changes and formatting to pseudocode) Tag: Visual edit
- diffhist Hamiltonian path 13:05 0 MrSwedishMeatballs talk contribs (→Properties) Tags: Mobile edit Mobile web edit Advanced mobile edit