Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7502159> ?p ?o }
Showing triples 1 to 8 of
8
with 100 triples per page.
- Q7502159 subject Q7216428.
- Q7502159 abstract "The Shortest Path Faster Algorithm (SPFA) is an improvement of the Bellman–Ford algorithm which computes single-source shortest paths in a weighted directed graph. The algorithm is believed to work well on random sparse graphs and is particularly suitable for graphs that contain negative-weight edges. However, the worst-case complexity of SPFA is the same as that of Bellman–Ford, so for graphs with nonnegative edge weights Dijkstra's algorithm is preferred. The SPFA algorithm was published in 1994 by Fanding Duan.".
- Q7502159 wikiPageExternalLink Shortest_Path_Faster_Algorithm.
- Q7502159 wikiPageWikiLink Q7216428.
- Q7502159 wikiPageWikiLink Q816022.
- Q7502159 wikiPageWikiLink Q8548.
- Q7502159 comment "The Shortest Path Faster Algorithm (SPFA) is an improvement of the Bellman–Ford algorithm which computes single-source shortest paths in a weighted directed graph. The algorithm is believed to work well on random sparse graphs and is particularly suitable for graphs that contain negative-weight edges. However, the worst-case complexity of SPFA is the same as that of Bellman–Ford, so for graphs with nonnegative edge weights Dijkstra's algorithm is preferred.".
- Q7502159 label "Shortest Path Faster Algorithm".