Depth First Search

void dfs(int from, std::vector<bool> &visited)
{
    visited[from] = true;

    // do something

    for(int &to : edges[from])
        if(!visited[to])
            dfs(to, visited);
}