lecture 19 shortest paths iii all-pairs shortest paths, matrix multiplication, floyd-warshall, johns

lecture 19 shortest paths iii all-pairs shortest paths, matrix multiplication, floyd-warshall, johns

ID:33942391

大小:125.16 KB

页数:15页

时间:2019-02-28

lecture 19 shortest paths iii all-pairs shortest paths, matrix multiplication, floyd-warshall, johns_第1页
lecture 19 shortest paths iii all-pairs shortest paths, matrix multiplication, floyd-warshall, johns_第2页
lecture 19 shortest paths iii all-pairs shortest paths, matrix multiplication, floyd-warshall, johns_第3页
lecture 19 shortest paths iii all-pairs shortest paths, matrix multiplication, floyd-warshall, johns_第4页
lecture 19 shortest paths iii all-pairs shortest paths, matrix multiplication, floyd-warshall, johns_第5页
资源描述:

《lecture 19 shortest paths iii all-pairs shortest paths, matrix multiplication, floyd-warshall, johns》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

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

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

3、2005Transcript–Lecture19--shortestpaths.Thisisthefinale.Hopefullyitwasworthwaitingfor.Remindyouthere'saquizcomingupsoon,youshouldbestudyingforit.There'snoproblemsetdueatthesametimeasthequizbecauseyoushouldbestudyingnow.It'satake-homeexam.It'srequiredthatyoucometoclassonMonday.Of

4、course,you'llallcome,buteveryonewatchingathomeshouldalsocomenextMondaytogetthequiz.It'stherequiredlecture.So,weneedabitofarecapinthetrilogysofar.So,thelasttwolectures,thelasttwoepisodes,oraboutsinglesourceshortestpaths.So,wewantedtofindtheshortestpathfromasourcevertextoeveryothe

5、rvertex.And,wesawafewalgorithmsforthis.Here'ssomerecap.Wesawintheunweightedcase,thatwassortoftheeasiestwherealltheedgeweightswereone.Thenwecouldusebreadthfirstsearch.Andthiscostswhatwecalllineartimeinthegraphworld,thenumberofverticesplusthenumberofedges.Thenextsimplestcase,perha

6、ps,isnonnegativeedgeweights.Andinthatcase,whatalgorithmdoweuse?Dijkstra,allright,everyone'sawake.Severalanswersatonce,great.Sothistakesalmostlineartimeifyouuseagoodheapstructure,so,VlogVplusE.And,inthegeneralcase,generalweights,wewoulduseBellman-Fordwhichyousaw.AndthatcostsVE,go

7、od,OK,whichisquiteabitworse.Thisisignoringlogfactors.Dijkstraisbasicallylineartime,Bellman-Fordyou'requadraticifyouhaveaconnectedgraph.So,inthesparsecase,whenEisorderV,thisisaboutlinear.Thisisaboutquadratic.Inthedensecase,whenEisaboutV^2,thisisquadratic,andthisiscubic.So,Dijkstr

8、aandBellman-FordareseparatedbyaboutanorderofVfa

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

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

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