Revision as of 12:19, 1 November 2011 edit Morgurth (talk \| contribs) 7 edits →Reduction from an NP-Complete problem? ← Previous edit		Revision as of 12:32, 1 November 2011 edit undo Morgurth (talk \| contribs) 7 edits →Zero weight cycles Next edit →
Line 23: In every finite graph, there is only a finite number of paths, because no path may visit a vertex or an edge twice. Therefore, there is only a finite number of shortest paths, too. However, finding a shortest path in graphs with arbitrary edge-weights is NP-hard. [[User:Morgurth\|Morgurth]] ([[User talk:Morgurth\|talk]]) 12:13, 1 November 2011 (UTC) Note: And with path, I mean simple path in the terminology that is used on Wikipedia. [[User:Morgurth\|Morgurth]] ([[User talk:Morgurth\|talk]]) 12:32, 1 November 2011 (UTC) == Counting to infinity ==

Talk:Bellman–Ford algorithm: Difference between revisions