graphgraphsearch

graphsearch  时间:2021-05-25  阅读:()
Assignment12SampleproblemsSampleproblemsGraphSearchGraphSearchInthefollowinggraphs,assumethatifthereiseverachoiceamongstmultiplenodes,boththeBFSandDFSalgorithmswillchoosetheleft-mostnodefirst.
Startingfromthegreennodeatthetop,whichalgorithmwillvisittheleastnumberofnodesbeforevisitingtheyellowgoalnodeA:BFSB:DFSC:NeitherBFSnorDFSwilleverencounterthegoalnodeinthisgraph.
C:NeitherBFSnorDFSwilleverencounterthegoalnodeinthisgraph.
D:BFSandDFSencountersamenumberofnodesbeforeencounterthegoalnodeA:BFSB:DFSC:NeitherBFSnorDFSwilleverencounterthegoalnodeinthisgraph.
C:NeitherBFSnorDFSwilleverencounterthegoalnodeinthisgraph.
D:BFSandDFSencountersamenumberofnodesbeforeencounterthegoalnodeTheanswerisBFSHowcanwegetForBFSalgorithm,visitinganode'ssiblingsbeforeitschildren,whileinDFSalgorithm,visitinganode'schildrenbeforeitssiblingsBeforecounteringgoalnodeBeforecounteringgoalnodeF:BFSalgorithmencountersnodes:ABCDEDFSalgorithmencountersnodes:ABDHLIEJMCInthefollowinggraphs,assumethatifthereiseverachoiceamongstmultiplenodes,boththeBFSandDFSalgorithmswillchoosetheleft-mostnodefirst.
Startingfromthegreennodeatthetop,whichalgorithmwillvisittheleastnumberofnodesbeforevisitingtheyellowgoalnodeA:BFSB:DFSC:NeitherBFSnorDFSwilleverencounterthegoalnodeinthisgraph.
C:NeitherBFSnorDFSwilleverencounterthegoalnodeinthisgraph.
D:BFSandDFSencountersamenumberofnodesbeforeencounterthegoalnodeA:BFSB:DFSC:NeitherBFSnorDFSwilleverencounterthegoalnodeinthisgraph.
C:NeitherBFSnorDFSwilleverencounterthegoalnodeinthisgraph.
D:BFSandDFSencountersamenumberofnodesbeforeencounterthegoalnodeTheanswerisDFSHowcanwegetForBFSalgorithm,visitinganode'ssiblingsbeforeitschildren,whileinDFSalgorithm,visitinganode'schildrenbeforeitssiblingsBeforecounteringgoalnodeBeforecounteringgoalnodeG:BFSalgorithmencountersnodes:ABCDEFDFSalgorithmencountersnodes:ABDConsiderthefollowinggraph.
IfthereiseveradecisionbetweenmultipleneighbornodesintheBFSorDFSalgorithms,assumewealwayschoosetheletterclosesttothebeginningofthealphabetfirst.
InwhatorderwillthenodesbevisitedusingaBreadthFirstSearchInwhatorderwillthenodesbevisitedusingaDepthFirstSearchConsiderthefollowinggraph.
IfthereiseveradecisionbetweenmultipleneighbornodesintheBFSorDFSalgorithms,assumewealwayschoosetheletterclosesttothebeginningofthealphabetfirst.
InwhatorderwillthenodesbevisitedusingaBreadthFirstSearchTheansweris:ABDCEGHFInwhatorderwillthenodesbevisitedusingaDepthFirstSearchTheansweris:ABCEHFGDHowcanwegetA->B->DB->C->E->GD->CC->AE->HE->HG->FH->F->GSoforBFS,theanswerisABDCEGHFforDFS,theanswerisABCEHFGDShootingballoonShootingballoonSupposeyouareplayinggameofshootingballoon.
Youexpecttoshootnballoonsintheboard,assumingyouaresharpshooter,100%hit.
Therearetwoscenarios,youneedfindtheappropriateBigOhnotationforeachscenario.
Intheseproblems,oneunitofworkisshootingoneballoon.
unitofworkisshootingoneballoon.
Scenario1:Forevery2balloonsyouareabletoshoot,onenewballoonisinsertedintheboard.
So,iftherewere20balloons,afteryoushootthefirst2,thereare19ontheboard.
Afteryoushootthenext2,thereare18ontheboard.
HowmanyballoonsdoyoushootbeforetheboardisemptybeforetheboardisemptyA:O(1)B:O(n)C:O(lgn)D:O(n)Scenario1:Forevery2balloonsyouareabletoshoot,onenewballoonisinsertedintheboard.
So,iftherewere20balloons,afteryoushootthefirst2,thereare19ontheboard.
Afteryoushootthenext2,thereare18ontheboard.
HowmanyballoonsdoyoushootbeforetheboardisemptyA:O(1)B:O(n)B:O(n)C:O(lgn)D:O(n)ifOneballoonontheboard,youshoot1balloonintotal,iftwoballoonsontheboard,youshoot3balloons,ifthreeballoonsontheboard,youshoot5balloonsintotal.
Sofollowit,youshoot2*n-1balloonsintotal.
Scenario2:Bythetimeyouhaveshootthefirstnballoons,n-1newballoonshavebeeninsertedontheboard.
Aftershootingthosen-1balloons,therearen-2newballoonsareinsertedontheboard.
Aftercheckingoutthosen-2balloons,therearen-3newballoonsontheboard.
Thissamepatterncontinuesuntilonnewballoonareinsertedontheboard.
Howmanytotalballoonsdoyouontheboard.
HowmanytotalballoonsdoyoushootbeforetheboardisemptyA:O(1)B:O(n)C:O(lgn)D:O(n)Scenario2:Bythetimeyouhaveshootthefirstnballoons,n-1newballoonshavebeeninsertedontheboard.
Aftershootingthosen-1balloons,therearen-2newballoonsareinsertedontheboard.
Aftercheckingoutthosen-2balloons,therearen-3newballoonsontheboard.
Thissamepatterncontinuesuntilonnewballoonareinsertedontheboard.
HowmanytotalballoonsdoyoushootbeforetheboardismanytotalballoonsdoyoushootbeforetheboardisemptyA:O(1)B:O(n)C:O(lgn)D:O(n)(n+n-1+n-2+n-3+……+n-(n-1)+n-(n))=(n*n-(n*(n+1)/2))

hypervmart:英国/荷兰vps,2核/3GB内存/25GB NVMe空间/不限流量/1Gbps端口/Hyper-V,$10.97/季

hypervmart怎么样?hypervmart是一家国外主机商,成立于2011年,提供虚拟主机、VPS等,vps基于Hyper-V 2012 R2,宣称不超售,支持linux和windows,有荷兰和英国2个数据中心,特色是1Gbps带宽、不限流量。现在配置提高,价格不变,性价比提高了很多。(数据中心不太清楚,按以前的记录,应该是欧洲),支持Paypal付款。点击进入:hypervmart官方网...

妮妮云,美国cera CN2线路,VPS享3折优惠

近期联通CUVIP的线路(AS4837线路)非常火热,妮妮云也推出了这类线路的套餐以及优惠,目前到国内优质线路排行大致如下:电信CN2 GIA>联通AS9929>联通AS4837>电信CN2 GT>普通线路,AS4837线路比起前两的优势就是带宽比较大,相对便宜一些,所以大家才能看到这个线路的带宽都非常高。妮妮云互联目前云服务器开放抽奖活动,每天开通前10台享3折优惠,另外...

特网云,美国独立物理服务器 Atom d525 4G 100M 40G防御 280元/月 香港站群 E3-1200V2 8G 10M 1500元/月

特网云为您提供高速、稳定、安全、弹性的云计算服务计算、存储、监控、安全,完善的云产品满足您的一切所需,深耕云计算领域10余年;我们拥有前沿的核心技术,始终致力于为政府机构、企业组织和个人开发者提供稳定、安全、可靠、高性价比的云计算产品与服务。公司名:珠海市特网科技有限公司官方网站:https://www.56dr.com特网云为您提供高速、稳定、安全、弹性的云计算服务 计算、存储、监控、安全,完善...

graphsearch为你推荐
中平迅雷路由器itunes支出127http://www.tutorialspoint.com/css/css_dimension.htmloadedios支持ipad更新iphoneipad如何上网ipad如何允许app使用网络ipad连不上wifi苹果ipad突然连不上网了,是怎么回事?网络是好的,手机能上网。勒索病毒win7补丁求问win7 64位旗舰版怎么预防勒索病毒
西安服务器租用 vps代理 2019年感恩节 域名商 国外永久服务器 国外php主机 256m内存 美国主机代购 NetSpeeder hnyd 最漂亮的qq空间 全能空间 lamp兄弟连 hdsky SmartAXMT800 accountsuspended 第八届中美互联网论坛 fatcow ncp是什么 带宽测速 更多