如何使用 Golang 函数对数据结构进行广度优先遍历？

package main

import (
    "container/queue"
)

// Node represents a node in a graph.
type Node struct {
    Value    interface{}
    Children []*Node
}

// BFS performs a breadth-first search on the given graph.
func BFS(root *Node) {
    q := queue.NewFIFO()
    q.Push(root)

    for q.Len() > 0 {
        current := q.Pop().(*Node)
        // Process the current node
        println("Value:", current.Value)

        for _, child := range current.Children {
            q.Push(child)
        }
    }
}

func main() {
    // Create a sample graph
    root := &Node{
        Value:    1,
        Children: []*Node{
            {Value: 2},
            {Value: 3, Children: []*Node{{Value: 6}}},
        },
    }
    root.Children[0].Children = []*Node{{Value: 4}, {Value: 5}}

    // Perform BFS on the graph
    BFS(root)
}

Value: 1
Value: 2
Value: 3
Value: 4
Value: 5
Value: 6