Question

I have a graph which is essentially an ArrayList of Nodes, each of which stores their neighbors.

public class Node {
    ArrayList<Node> neighbors;
    String data;
    public Node() {
        data = null;
        neighbors = new ArrayList<Node>();
    }
}

I print out every path in this graph, but only do it n-levels deep. How should I go about coding this?

Or, if I should store this differently, feel free to let me know. But more importantly I want to know how to print out every path n-levels deep.

Answer 1

Just do a depth-limited traversal of the graph. This is just like depth-first search, except in the recursive step, you also add a variable called depth which is incremented every time you go down a depth. Then simply stop recursing once you’ve hit the desired depth.