Scribd Logo
Upload

Welcome to Scribd!

  • Chapter+9b - DFS - 2010 (Mode de Compatibilité)

    Uploaded by

    Thanh Bi Nguyen
    16 views5 pages
    The document discusses depth-first search (DFS) algorithms and their applications. It describes how DFS works by using an auxiliary function called DFSVisit() to recursively traverse vertices in a graph in depth-first order. It also marks vertices with colors (white, gray, black) to track the search progress and calculates discovery and finish times. Finally, it lists some applications of DFS like detecting cycles, finding connected components, topological sorting, and identifying articulation points.

    Original Description:

    Original Title

    Chapter+9b - DFS - 2010 [Mode de compatibilité]

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses depth-first search (DFS) algorithms and their applications. It describes how DFS works by using an auxiliary function called DFSVisit() to recursively traverse vertices in a graph in depth-first order. It also marks vertices with colors (white, gray, black) to track the search progress and calculates discovery and finish times. Finally, it lists some applications of DFS like detecting cycles, finding connected components, topological sorting, and identifying articulation points.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    16 views5 pages

    Chapter+9b - DFS - 2010 (Mode de Compatibilité)

    Uploaded by

    Thanh Bi Nguyen
    The document discusses depth-first search (DFS) algorithms and their applications. It describes how DFS works by using an auxiliary function called DFSVisit() to recursively traverse vertices in a graph in depth-first order. It also marks vertices with colors (white, gray, black) to track the search progress and calculates discovery and finish times. Finally, it lists some applications of DFS like detecting cycles, finding connected components, topological sorting, and identifying articulation points.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 5

    Chapter 9 GRAPH

    DFS algorithm Its applications

    Depth-first traversal
    <void> DFS() Traverses the digraph in depth-first order
    Uses 1.

    Auxiliary function DFSVisit()

    loop( more vertex v in digraph) 1. color[v] WHITE 2. father[v] null 2. time 0 3. loop( more vertex v in digraph) 1. if (color[v]= WHITE) 1. DFSVisit(v)

    end DFS

    <void> DFSVisit(vertex v) 1. color[v] GRAY 2. time time +1 3. d[v] time 4. loop (more vertex u adjacent to v) 1. if (color[u]= WHITE) 1. father[u] v 2. DFSVisit(u) 5. color[v] BLACK 6. time time +1 7. f[v] time

    end DFSVisit

    Depth-first traversal
    <void> DFS() Traverses the digraph in depth-first order
    Uses 1. <void> DFSVisit(vertex v) Auxiliary function DFSVisit() 1. 2. 3. 4. color[v] GRAY time time +1 d[v] time loop (more vertex u adjacent to v) 1. if (color[u]= WHITE) 1. father[u] v 2. DFSVisit(u) 5. color[v] BLACK 6. time time +1 7. f[v] time

    loop( more vertex v in digraph) 1. color[v] WHITE 2. father[v] null 2. time 0 3. loop( more vertex v in digraph) 1. if (color[v]= WHITE) 1. DFSVisit(v)

    end DFS

    end DFSVisit
    4

    How to modify DFS algorithm to


    a) determine whether there exists a cycle in graph b) calculate number of connected components c) determine topological order d) identify articulation points

    You might also like