Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
So far as I know, ...In Reply To:话说我一直不太明白啥是spfa……按我的理解,顶点序列用queue就是bellman-ford,用stack就是spfa,对不…… Posted by:wywcgs at 2008-11-10 18:35:40 ... 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. Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator