查找未知（树状）数据结构中一个节点范围内的所有节点

Question

the other day I made a quick tool to figure out exactly what the question asked but with a fixed range, which works well just by using a stupid amount of for loops but I would like to make it work for a use definable range.

The data structure in looks like

Where each node can link to any other number of nodes and can all link back to itself it you follow the right path(Which tended to break my implementations).

It's just defined as

type Node struct { Name string ID int }

And you can get a list of nodes it is linked with using a method which returns a slice of Nodes which gets the information from a database with around 5,000 entries.

Initially I tried some stuff with recursion which just ended up with me having a hurt head and code that just doesn't work. I just can't seem to get my head around this.

Thanks in advance, and if this type of data has a specific name I would love to know what it is!

Answer 1

My final code looked something like this

func rec(x Node, depth int) Node {
    s := make([]Node, 0)
    if depth == 0 {
        s = append(s, x)
    } else {
        for _, y := range x.Get() {
            s = append(s, rec(y, depth-1)...)
        }
    }
    return s
}

and it worked wonderfully. Thanks a lot to siritinga for pointing me in the right direction.