ford.c.zip
文件大小: 1k
下载次数:2
源码类别:

Internet/网络编程

开发平台:

C/C++

源码售价: 5 个金币 积分规则     积分充值
资源说明:Ford algorithms trees The Bellman–Ford algorithm computes single-source shortest paths in a weighted digraph. For graphs with only non-negative edge weights, the faster Dijkstra s algorithm also solves the problem. Thus, Bellman–Ford is used primarily for graphs with negative edge weights. The algorithm is named after its developers, Richard Bellman and Lester Ford, Jr.
本源码包内暂不包含可直接显示的源代码文件,请下载源码包。