Add merging to V3 resolve and node search

[n-h-diaz]

No description provided.

[keyurva]

Thanks!

[keyurva]

I'm wondering how expensive this check is and whether we need to check all? If we do, can we base it on result.Node.Dcid?

[keyurva]

nit and optional: I prompted gemini on different ways of merging arrays based on our requirements and it came up with the following. Feel free to use it and perfectly fine to ignore (the logic in the PR works):

func mergeArraysClean(arrays [][]int, maxNumResults int) []int {
        merged := make([]int, 0, maxNumResults)

        for len(merged) < maxNumResults && len(arrays) > 0 {
                newArrays := make([][]int, 0, len(arrays)) // Create a new slice for remaining arrays
                added := false

                for _, arr := range arrays {
                        if len(arr) > 0 {
                                merged = append(merged, arr[0])
                                added = true
                                if len(merged) >= maxNumResults {
                                        return merged
                                }
                                if len(arr) > 1 {
                                        newArrays = append(newArrays, arr[1:]) // Add remaining elements to the new slice
                                }
                        }
                }
                if !added {
                        break;
                }

                arrays = newArrays // Update arrays with the remaining sub-arrays
        }

        return merged
}