Pseudo-code for DFS and BFS.

travel.cpp

// DFS
void search(Node root) {
    if (root == NULL) {
        return;
    }
    visit(root);
    root.visited = true;
    foreach (Node n in root.adjacent) {
        if (n.visited = false) {
            search(n);
        }
    }
}

// BFS
void search(Node root) {
    Queue queue = new Queue();
    root.visited = true;
    visit(root);
    queue.enqueue(root);
    
    while(! queue.empty()) {
        Node r = queue.dequeue();
        foreach(Node n in r.adjacent) {
            if (n.visited == false) {
                visit(n);
                n.visited = true;
                queue.enqueue(n);
            }
        }
    }
}