代码搜索：Ford
找到约 286 项符合「Ford」的源代码
代码结果 286
www.eeworm.com/read/176655/5336103
ford
#
# $Id: ford,v 1.1.1.2 1997/07/03 21:43:46 chopps Exp $
#
# Configuration for SGI IRIS
#
bindir /usr/bin
sbindir /usr/etc
signal_h /usr/include/sys/signal.h
cc cc
cflags -g -D__sgi -Dsgi -Wf,-XNg10
www.eeworm.com/read/180245/9314711
txt ford.txt
Ford data ObD2
P1000 OBD II Monitor Testing Not Complete
P1001 Key On Engine Running Self-Test Not Completed - Test Aborted
P1100 Mass Airflow Sensor Circuit Intermittent
P1101 Ma
www.eeworm.com/read/359902/10116670
in bellman_ford.in
5 10
1 5
1 2 6
2 3 5
3 2 -2
1 4 7
2 4 8
4 3 -3
4 5 9
2 5 -4
5 1 2
5 3 7
0 0
www.eeworm.com/read/155618/6960686
in bellman_ford.in
5 10
1 5
1 2 6
2 3 5
3 2 -2
1 4 7
2 4 8
4 3 -3
4 5 9
2 5 -4
5 1 2
5 3 7
0 0
www.eeworm.com/read/343931/11919017
in bellman_ford.in
5 10
1 5
1 2 6
2 3 5
3 2 -2
1 4 7
2 4 8
4 3 -3
4 5 9
2 5 -4
5 1 2
5 3 7
0 0
www.eeworm.com/read/153352/12040510
gif ford.gif
www.eeworm.com/read/124110/14593889
m ford.m
function y=ford(D,start,term)
%逐步逼近算法可求带有负权边的网络任2点的最短路。
%0代表重合点，inf代表无连接。
a(1,:)=[0,50,inf,40,25,10];
a(2,:)=[zeros(1,2),15,20,inf,25];
a(3,:)=[zeros(1,3),10,20,inf];
a(4,:)=[zeros(1,4),10,25
www.eeworm.com/read/122401/14693947
gif ford.gif
www.eeworm.com/read/469247/1481943
m ford.m
function [minroad,s]=Ford(w) %注意此文件名一定要为Ford.m
%图论最短路的Ford迭代算法
%w为邻接矩阵(点与点的关系)
n=size(w,1);%记录图中点数
%赋初值
for i=1:n
p(i)=inf;%V1到Vi的最短路长记为p(i)
s(i)=i;%V1到Vi的最短路中Vi的前一个点记为s(i)
end
p(1)=
www.eeworm.com/read/469247/1481947
m ford.m
clear all
%图论最短路的Ford迭代算法
%邻接矩阵(点与点的关系)
w=[0,2,4,inf,inf,inf,inf;
2,0,inf,3,3,1,inf;
4,inf,0,2,3,1,inf;
inf,3,2,0,inf,inf,1;
inf,3,3,inf,