Revision as of 06:16, 21 April 2010 edit Justin W Smith (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 5,998 edits →Unclarity: r ← Previous edit		Revision as of 13:34, 21 April 2010 edit undo Justin W Smith (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 5,998 edits →Reduction from an NP-Complete problem?: clarify Next edit →
Line 90: ==Reduction from an NP-Complete problem?== The lead cites a reduction by Sedgewick from the [[NP-Complete]] [[Hamiltonian path problem]] to the [[shortest path problem]]. Since the shortest path problem (even <ins>for all-pairs</ins> with <ins>edges of</ins> negative ~~weights~~weight<del>s</del>) is not NP-Complete (i.e., Floyd-Warshall = O(n^3)), something needs to be clarified/corrected. <b>[[User:Justin W Smith\|Justin W Smith]]</b> <i><sup>[[User talk:Justin W Smith\|talk]]</sup>/<sub>[[Special:Contributions/Justin W Smith\|stalk]]</sub></i> 06:15, 21 April 2010 (UTC)

Talk:Bellman–Ford algorithm: Difference between revisions