Content deleted Content added
→Undefined Terms: new section |
|||
Line 50:
This article uses the terms "relax" and "relaxation" in a specific technical sense, but gives no definition. The use of undefined terms in mathematical writing is considered poor form. -- [[Special:Contributions/172.191.112.126|172.191.112.126]] ([[User talk:172.191.112.126|talk]]) 23:08, 25 February 2009 (UTC)
== Dijkstra is not greedy ==
The Shortest-Path-Problem for graphs with non-negative-weights doesn't have a [[matroid]] or [[greedoid]] structure. Therefore this problem cannot be solved by an greedy-algorithm. Therefore Dijkstra is not greedy.
| |||