Content deleted Content added
m Signing comment by 66.119.173.210 - "→Undefined Terms: " |
Chris-martin (talk | contribs) →As hard as an NP-complete problem: new section |
||
Line 66:
I removed the "C implementation" section. This seems to be out of place in a wikipedia article. There is already the pseudocode, which conveys how that algorithm works. The C code is quite long, difficult to verify, and redundant. And a GFDL license is not really useful for sharing code. There is also a discussion at [http://en.wikipedia.org/wiki/Wikipedia_talk:WikiProject_Computer_science#Source_code_written_by_editors] that led me here. — Carl <small>([[User:CBM|CBM]] · [[User talk:CBM|talk]])</small> 00:24, 8 April 2009 (UTC)
== As hard as an NP-complete problem ==
The last paragraph in the summary, regarding "the shortest path that does not repeat any vertex in such a graph", states:
:"This problem is at least as hard as the NP-complete longest path problem."
This seems like a very silly expression. Doesn't it just mean that the problem at least as hard as '''any''' NP-complete problem - which can be best stated by just calling it [[NP-hard]]? ~ [[User:Booyabazooka|Booya <sup>Bazooka</sup>]] 23:02, 4 October 2009 (UTC)
| |||