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))

搬瓦工VPS:高端线路,助力企业运营,10Gbps美国 cn2 gia,1Gbps香港cn2 gia,10Gbps日本软银

搬瓦工vps(bandwagonhost)现在面向中国大陆有3条顶级线路:美国 cn2 gia,香港 cn2 gia,日本软银(softbank)。详细带宽是:美国cn2 gia、日本软银,都是2.5Gbps~10Gbps带宽,香港 cn2 gia为1Gbps带宽,搬瓦工是目前为止,全球所有提供这三种带宽的VPS(云服务器)商家里面带宽最大的,成本最高的,没有第二家了! 官方网站:https...

WebHorizon($10.56/年)256MB/5G SSD/200GB/日本VPS

WebHorizon是一家去年成立的国外VPS主机商,印度注册,提供虚拟主机和VPS产品,其中VPS包括OpenVZ和KVM架构,有独立IP也有共享IP,数据中心包括美国、波兰、日本、新加坡等(共享IP主机可选机房更多)。目前商家对日本VPS提供一个8折优惠码,优惠后最低款OpenVZ套餐年付10.56美元起。OpenVZCPU:1core内存:256MB硬盘:5G NVMe流量:200GB/1G...

Raksmart:香港高防服务器/20Mbps带宽(cn2+bgp)/40G-100Gbps防御

RAKsmart怎么样?RAKsmart香港机房新增了付费的DDoS高防保护服务,香港服务器默认接入20Mbps的大陆优化带宽(电信走CN2、联通和移动走BGP)。高防服务器需要在下单页面的IP Addresses Option里面选择购买,分:40Gbps大陆优化高防IP-$461/月、100Gbps国际BGP高防IP-$692/月,有兴趣的可以根据自己的需求来选择!点击进入:RAKsmart官...

graphsearch为你推荐
Dimensionfastreport2Holidaydivuctuationchrome内存nod32usergoogle计划ipad支持ipad支持ipadeacceleratorCentOS5.2下安装eAccelerator,怎么都装不上x-routerX-TRAlL是什么意思
国外vps 免费申请网页 狗爹 外贸主机 godaddy续费优惠码 gomezpeer 青果网 java虚拟主机 京东商城双十一活动 毫秒英文 网站木马检测工具 免费防火墙 cdn加速原理 免费cdn drupal安装 cloudlink 防cc攻击 japanese50m咸熟 最新优惠 ipower 更多