depth first search

depth first search

ID:40601765

大小:1.16 MB

页数:8页

时间:2019-08-04

depth first search_第1页
depth first search_第2页
depth first search_第3页
depth first search_第4页
depth first search_第5页
资源描述:

《depth first search》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、DEPrH-FIRSTSEARCH.ANI)LmEARGRAmALGORITHMS(WorkingPaper)RobertTarjanComputerScienceDepartmentStanfordUniversityStanford,CaliforniaSl.UlIDlaryThevalueofdepth-firstsearchor"backtracking"wandwisadescendantofv.Ifvisavertexasatechniqueforsolvinggraphproblemsisil

2、lustra•inatreeT,TvisthesubtreeofThavingastedbytwoexamples.AnalgorithmforfindingtheverticesallthedescendantsofvinT.IfGisbiconnectedcomponentsofanundirectedgraphandanadirectedgraph,atreeTisaspanningtreeofGimprovedversionofanalgorithmforfindingtheifTisasubgra

3、phofGandTcontainsallthestronglyconnectedcomponentsofadirectedgraphareverticesofG.presented.ThespaceandtimerequirementsofbothalgorithInsareboundedbyklV+k2E+k3forsomeDepth-FirstSearchconstantsk,k'andk,whereVisthentunberl23Atechniquewhichhasbeenwidelyusedforf

4、indingofverticesandEisthenumberofedgesofthesolutionstoproblemsincombinatorialtheoryandgraphbeingexamined.6artifici~lintelligence,8butwhosepropertieshaveIntroductionnotbeenwidelyanalyzedisofgreatvalueinsolvinggraphproblems.Thisisbacktracking,ordepth-firstCo

5、nsideragraphG,consistingofasetofsearch.SupposeGisagraphwhichwewishtoverticesVandasetofedgese.Thegraphmayexplore.InitiallyalltheverticesofGareunex•eitherbedirected(theedgesareorderedpairs(v,w)plored.WestartfromsomevertexofGandchooseofvertices;visthetailandw

6、istheheadofanedgetofollow.Traversingtheedgeleadstoanewtheedge)orundirected(theedgesareunorderedpairsvertex.Wecontinueinthisway;ateachstepweofvertices,alsorepresentedas(v,w)).Graphsselectanunexplorededgeleadingfromavertexalreadyformasuitableabstractionforpr

7、oblemsinmanyareas;reachedandwetraversethisedge.Theedgeleadstochemistry,electricalengineering,andsociology,forsomevertex,eitherneworalreadyreached.Wheneverexample.Theyarealsoverygeneralstructuresforwerunoutofedgesleadingfromoldvertices,westoringandretrievin

8、ginformation.Manyquestionsmaychoosesomeunreachedvertex,ifanyeXists,andbeginbeaskedaboutgraphs;weneedthefastest,mosteco•anewexplorationfromthispoint.Eventuallywewillnomicalalgorithmstogiveanswerstothesequestio

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

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

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