competitive_programming_lib/Algorithms/
dfs.rs

1pub fn dfs(graph: &Vec<Vec<usize>>, start: usize, visited: &mut Vec<bool>) {
2    visited[start] = true;
3    for &neighbor in &graph[start] {
4        if !visited[neighbor] {
5            dfs(graph, neighbor, visited)
6        }
7    }
8}