(1)输入E条弧<j,k>,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1<=i<=n-1).如果得到的拓朴有序序列中顶点个数小于网中顶点数n,则说明网中存在环,不能求关键路径,算法终止 否则执行步骤(3)(3)从汇点v出发,令vl[n-1]=ve[n-1],按逆拓朴排序求其余各顶点的最迟发生时间vl[i](n-2>=i>=2). (4)根据各顶点的ve和vl值,求每条弧s的最早发生时间e(s)和最迟开始时间l(s).若某条弧满足条件e(s)=l(s),则为关键活动.
上传时间： 2014-11-28
上传用户：fredguo
This software was done in part for a textbook on AI I ve written called _The Basis of AI_ (tentative title, subject to change but not if I get my way). For details see: http://www.mcs.com/~drt/basisofai.html
标签： tentative software textbook written
上传时间： 2015-03-30
上传用户：cxl274287265
the attached utility is a work I ve submitted to the university It shows what a jpeg compression is all about.
标签： compression university the submitted
上传时间： 2015-06-12
上传用户：zhouchang199
Naï ve. Bayes算法的java程序（只含源码）
上传时间： 2014-11-11
上传用户：woshiayin
一个用JAVA编写的ELM-ve 服务器-客户端系统,比较全面地展示了该类系统的结构。
上传时间： 2013-12-17
上传用户：ruixue198909
Ever wondered how all those COM components that you ve written through the years play along with the .NET runtime. If you are a diehard COM developer interested in knowing how Classic COM Components are positioned in the .NET world or how COM aware clients could consume .NET components, read on.
标签： components the wondered through
上传时间： 2013-12-18
上传用户：kristycreasy
fg erdg erg adgr ce vdr ve rt cer
上传时间： 2015-09-06
上传用户：671145514
if you do what you ve always done,you will get what you ve always getten.很不错的名言，这本电子书里介绍很多人的成功经验．
上传时间： 2015-09-24
上传用户：Avoid98
Delphi RTL-VCL optimization addon. I ve used, really good job.
标签： optimization RTL-VCL Delphi really
上传时间： 2013-12-16
上传用户：lunshaomo
Delphi MsgCommunicator 2-10 component.I ve used, really good job. can be Server-Client message application developped.
标签： MsgCommunicator Server-Client component message
上传时间： 2016-02-18
上传用户：zhuimenghuadie
