Scribd Logo
Unggah

Selamat datang di Scribd!

  • 04 Graphs Bfs

    Diunggah oleh

    navadweep
    21 tayangan2 halaman
    Breadth-first search visits all adjacent nodes before visiting their children, traversing the graph in levels starting from the root node. It uses a queue to store unvisited nodes. Breadth-first search is used for finding all connected components in a graph, finding the shortest path between nodes in an unweighted graph using Dijkstra's algorithm, and testing if a graph is bipartite. Depth-first search recursively explores as far as possible along each branch before backtracking. It is used to find articulation points, determine if a graph is connected, find cycles, and solve the Euler circuit problem.

    Deskripsi Asli:

    Hak Cipta

    © Attribution Non-Commercial (BY-NC)

    Format Tersedia

    PDF, TXT atau baca online dari Scribd

    Apakah menurut Anda dokumen ini bermanfaat?

    Apakah konten ini tidak pantas?

    Laporkan Dokumen Ini
    Breadth-first search visits all adjacent nodes before visiting their children, traversing the graph in levels starting from the root node. It uses a queue to store unvisited nodes. Breadth-first search is used for finding all connected components in a graph, finding the shortest path between nodes in an unweighted graph using Dijkstra's algorithm, and testing if a graph is bipartite. Depth-first search recursively explores as far as possible along each branch before backtracking. It is used to find articulation points, determine if a graph is connected, find cycles, and solve the Euler circuit problem.

    Hak Cipta:

    Attribution Non-Commercial (BY-NC)
    Unduh sebagai PDF, TXT atau baca online dari Scribd
    Tandai sebagai konten tidak pantas
    21 tayangan2 halaman

    04 Graphs Bfs

    Diunggah oleh

    navadweep
    Breadth-first search visits all adjacent nodes before visiting their children, traversing the graph in levels starting from the root node. It uses a queue to store unvisited nodes. Breadth-first search is used for finding all connected components in a graph, finding the shortest path between nodes in an unweighted graph using Dijkstra's algorithm, and testing if a graph is bipartite. Depth-first search recursively explores as far as possible along each branch before backtracking. It is used to find articulation points, determine if a graph is connected, find cycles, and solve the Euler circuit problem.

    Hak Cipta:

    Attribution Non-Commercial (BY-NC)
    Unduh sebagai PDF, TXT atau baca online dari Scribd
    Tandai sebagai konten tidak pantas
    dari 2

    GraphsBreadthfirstSearchandSearchUses

    CarolZander

    Breadthfirstsearch
    Thebreadthfirstalgorithmvisitsalladjacentnodes(children)beforevisitingtheiradjacentnodes,andsoon. Aswithdepthfirst,whenwevisiteachvertex,wehavetodecideinwhatordertovisittheadjacentvertex. Wewillassumeanunderlyingorderingimpliedbythenodenumber(orindex).Westartatvertex1(or0 dependingonwherewestartcounting)andconsiderasmallernumberednodebeforealargernumbered node.
    void breadthFirstSearch(. . .) { // mark all the vertices as not visited for v = 1 to n { if (v is not visited) bfs(v); } } void bfs(v ...){ mark v as visited Q.enqueue(v); while (Q is not empty) { x = Q.dequeue(); output x (or do whatever, output give breadth-first ordering) for each vertex w adjacent to x { if (w is not visited) { mark w as visited Q.enqueue(w); } } } }

    Usethesameexample(unconnectedgraph)asusedwithdepthfirst:

    10

    12

    11

    Thebreadthfirstorderingis123945867101112.

    Page 1 of 2

    UsesofBreadthfirstsearch
    BreadthfirstTraversingisoftenusedfortheprocessingofdigitalimages.Itpresentsefficientalgorithmsfor eroding,dilating,skeletonizing,anddistancetransformingregions.Thesealgorithmsworkbytraversing regionsinabreadthfirstmanner,usingaqueueforstorageofunprocessedpixels.Theyusememory efficientlypixelsareremovedfromthequeueassoonastheirprocessinghasbeencompletedandthey processonlypixelsintheregion(andtheirneighbors),ratherthanrequiringacompletescanoftheimage. Theimageisstillrepresentedasapixelmatrixinmemory;thegraphisjustaconvenientframeworkfor thinkingaboutthealgorithms. Breadthfirstsearch(BFS)isusedforfindingallconnectedcomponentsinagraph(findingallnodeswithinone connectedcomponent).ThesetofnodesreachedbyaBFSarethelargestconnectedcomponentcontaining thestartnode. AvariationofBFSisusedforfindingtheshortestpathbetweentwonodesuandv(inanunweightedgraph).It isalsousedforfindingtheshortestpathbetweentwonodesuandv(inaweightedgraph).ThisisDijkstras algorithm. BFScanbeusedtotestbipartiteness(whenagraphssetofverticescanbedividedintotwodisjointsetsso thateveryedgeinthegraphconnectsavertexfromonesettotheother,seeSection9.2inthetext).The algorithmstartsthesearchatanyvertexandgivesalternatinglabelstotheverticesvisitedduringthesearch. Thatis,givelabel0tothestartingvertex,1toallitsneighbors,0tothoseneighbors'neighbors,andsoon.Ifat anystepavertexhas(visited)neighborswiththesamelabelasitself,thenthegraphisnotbipartite.Ifthe searchendswithoutsuchasituationoccurring,thenthegraphisbipartite.

    UsesofDepthfirstsearch
    Abiconnectedgraphisagraphwheretheremovalofnoverticesdisconnectsthegraph.Thisisimportantwith networks.Ifonecomputergoesdown,thenetworkshouldnotbeaffected.Similarlyinamasstransitsystem, thereneedstobealternateroutes.Anarticulationpointisanodewhoseremovalwoulddisconnectthegraph (criticaltoproblemsmentioned).Allarticulationpointsinaconnectedgraphcanbefoundusingdepthfirst search.

    AnEulercircuitisapaththatvisitseveryedgeexactlyonce.(In1736,Eulerproposedtheproblemoffinding thesecircuits.Thiswasthebeginningofgraphtheory.)Thisproblemissolvedusingavariationofdepthfirst search:keepremovingcomponentsthatgetyoutowhereyoustartedfrom.

    Otherquestionsthatcanbeanswered: Isagraphconnected?Ifnot,whatareitsconnectedcomponents? Doesagraphhaveacycle? Inadirectedgraph,isthereapathfromxtoy? Findthetransitiveclosure(addedgessothatyoucangetfromanynodextoanynodey).

    Page 2 of 2

    Anda mungkin juga menyukai