2023-10-20 13:41:06 +02:00
|
|
|
package lib
|
|
|
|
|
|
|
|
import "math/rand"
|
|
|
|
|
|
|
|
// RandomSubsetOfLength: Given an array of nodes generate of random
|
|
|
|
// subset of 'num' length.
|
|
|
|
func RandomSubsetOfLength[V any](vs []V, num int) []V {
|
|
|
|
randomSubset := make([]V, 0)
|
|
|
|
selectedIndices := make(map[int]struct{})
|
|
|
|
|
|
|
|
for i := 0; i < num; {
|
2023-10-20 18:35:02 +02:00
|
|
|
if len(randomSubset) == len(vs) {
|
2023-10-20 13:41:06 +02:00
|
|
|
return randomSubset
|
|
|
|
}
|
|
|
|
|
|
|
|
randomIndex := rand.Intn(len(vs))
|
|
|
|
|
|
|
|
if _, ok := selectedIndices[randomIndex]; !ok {
|
|
|
|
randomSubset = append(randomSubset, vs[randomIndex])
|
|
|
|
i++
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return randomSubset
|
|
|
|
}
|