> ... the so-called `SPFA' algorithm is exactly the FIFO implementation of the
> Bellman-Ford-Moore algorithm (BFMA). In fact, many authors consider the use
> of a FIFO queue as an inherent part of the BFMA, not just a variant. I
> believe that the name `SPFA' as perceived in the Chinese programming contest
> circle was first coined in an article by some candidate to the Chinese OI
> team. The article claimed that the algorithm runs in linear time, which I
> think drew the attention of many beginners. The claim was absolutely bogus as
> instances that force the algorithm to exhibit quadratic behavior are not
> hard to construct. Nevertheless, it managed to give fame to the misnomer,
> resulting in widespread misunderstanding.