lecture 18 shortest paths ii bellman-ford, linear programming, difference constraints

lecture 18 shortest paths ii bellman-ford, linear programming, difference constraints

ID:33937180

大小:127.99 KB

页数:16页

时间:2019-03-01

lecture 18 shortest paths ii bellman-ford, linear programming, difference constraints_第1页
lecture 18 shortest paths ii bellman-ford, linear programming, difference constraints_第2页
lecture 18 shortest paths ii bellman-ford, linear programming, difference constraints_第3页
lecture 18 shortest paths ii bellman-ford, linear programming, difference constraints_第4页
lecture 18 shortest paths ii bellman-ford, linear programming, difference constraints_第5页
资源描述:

《lecture 18 shortest paths ii bellman-ford, linear programming, difference constraints》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、MITOpenCourseWarehttp://ocw.mit.edu6.046JIntroductiontoAlgorithms,Fall2005Pleaseusethefollowingcitationformat:ErikDemaineandCharlesLeiserson,6.046JIntroductiontoAlgorithms,Fall2005.(MassachusettsInstituteofTechnology:MITOpenCourseWare).http://ocw.mit.edu(accessedMMDD,YYYY).License:

2、CreativeCommonsAttribution-Noncommercial-ShareAlike.Note:Pleaseusetheactualdateyouaccessedthismaterialinyourcitation.FormoreinformationaboutcitingthesematerialsorourTermsofUse,visit:http://ocw.mit.edu/termsMITOpenCourseWarehttp://ocw.mit.edu6.046JIntroductiontoAlgorithms,Fall2005Tr

3、anscript–Lecture18Goodmorning,everyone.Gladyouareallherebrightandearly.I'mcountingthedaystilltheTA'soutnumberthestudents.They'llshowup.Wereturntoafamiliarstory.Thisisparttwo,theEmpireStrikesBack.Solasttime,ouradversary,thegraph,cametouswithaproblem.Wehaveasource,andwehadadirectedgr

4、aph,andwehadweightsontheedges,andtheywereallnonnegative.Andtherewashappiness.AndwetriumphedovertheEmpirebydesigningDijkstra'salgorithm,andveryefficientlyfindingsinglesourceshortestpaths,shortestpathweightfromstoeveryothervertex.Today,however,theDeathStarhasanewtrickupitssleeve,andw

5、ehavenegativeweights,potentially.Andwe'regoingtohavetosomehowdealwith,inparticular,negativeweightcycles.Andwesawthatwhenwehaveanegativeweightcycle,wecanjustkeepgoingaround,andaround,andaround,andgobackintimefarther,andfarther,andfarther.Andwecangettobearbitrarilyfarbackinthepast.An

6、dsothere'snoshortestpath,becausewhateverpathyoutakeyoucangetashorterone.Sowewanttoaddressthatissuetoday,andwe'regoingtocomeupwithanewalgorithmactuallysimplerthanDijkstra,butnotasfast,calledtheBellman-Fordalgorithm.And,it'sgoingtoallownegativeweights,andinsomesenseallownegativeweigh

7、tcycles,althoughmaybenotasmuchasyoumighthope.Wehavetoleaveroomforasequel,ofcourse.OK,sotheBellman-Fordalgorithm,inventedbytwoguys,asyoumightexpect,itcomputestheshortestpathweights.So,itmakesnoassumptionabouttheweights.Weightsarearbitrary,andit'sgoingtocomputetheshortestpathweights.

8、So,rememberthisnotation:de

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。