🤖depth-first search

🚧 under construction

data structure ⟩ graph ⟩ DFS

Depth-First Search (DFS)

visits a graph node and explores its child nodes or branches before proceeding to the next node. (going deep first before going wide)

• a recursive algorithm that leverages the stack.

// code

🖥️ 影片

⭐️ 重點

// pseudo code
dfs(Graph G, GraphNode root) {

    // base case
    if (root is null) return
 
    // mark root as visited
    root.visited = true
 
    for (neighbors n of root in G)
        if (n is not yet visited)
            dfs(G, n) // recursive call
}

📗 參考

• MakeUseOf ⟩ A Guide to the Graph Data Structure

• simplilearn ⟩ Your One-Stop Solution For Graphs In Data Structures

• Eloqent JavaScript ⟩ Ch. 7 Project: A Robot

• VisuAlgo ⟩ GRAPH TRAVERSAL (DFS/BFS)