Revision as of 20:01, 23 January 2024 edit 128.226.2.54 (talk) →Attribution: new section Tag: New topic ← Previous edit		Revision as of 21:02, 23 January 2024 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,585 edits →Attribution: Reply Tag: Reply Next edit →
Line 263: Also, the citation to MathWorld is unwise. MathWorld is notably unreliable. A citation to a real publication is needed. [[Special:Contributions/128.226.2.54\|128.226.2.54]] ([[User talk:128.226.2.54\|talk]]) 20:01, 23 January 2024 (UTC) :The algorithms in question are all using a dynamic program to compute aggregate information about the same subsets of paths of a graph, in the same order. They differ only in what aggregate information they compute: whether it is the existence of a path or whether it is the minimum weight of the path. That is, where one has an OR, the other has a MIN. That is the only difference. —[[User:David Eppstein\|David Eppstein]] ([[User talk:David Eppstein\|talk]]) 21:02, 23 January 2024 (UTC)

Talk:Floyd–Warshall algorithm: Difference between revisions