Depth-First Search: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

6 May 2023

  • curprev 05:0505:05, 6 May 2023‎ Admin talk contribs‎ 1,984 bytes +77‎ No edit summary undo
  • curprev 04:0004:00, 6 May 2023‎ Admin talk contribs‎ 1,907 bytes +1,907‎ Created page with "== Depth-First Search == Depth-First Search (DFS) is a graph traversal algorithm that explores all the vertices of a graph by visiting nodes as deep as possible before backtracking. DFS can be implemented using recursion or an explicit stack data structure. === Algorithm === Start at the source node and mark it as visited. For each adjacent node of the source node, if it is not visited, perform a recursive DFS from the adjacent node. === Time Complexity ===..."
Retrieved from "https://wiki.usaco.fun/index.php/Depth-First_Search"