User blog comment:Wythagoras/New bound for SSCG(2)/@comment-5529393-20130714151318/@comment-1605058-20130714193733

For example, say we want to find optimal path between cities A,B,C and D with |AB|=1, |AC|=|AD|=|BC|=2, |BD|=3, |CD|>9000. Greedy algorithm will follow first AB of weight 1, then BC of weight 2, then very suboptimal edge CD, while there are paths of weight 7, like ADBC.