Source File
	traversal.go

Belonging Package
	github.com/pancsta/d2/d2layouts/d2talalayout/internal/trees

package trees

import "github.com/pancsta/d2/d2layouts/d2talalayout/internal/layoutgraph"

// Descendants returns tree descendants in the breadth-first order used when
// restored tree nodes and edges are copied back into an owning graph.
func Descendants(root *layoutgraph.Tree) []*layoutgraph.Tree {
	if root == nil {
		return nil
	}
	descendants := make([]*layoutgraph.Tree, 0)
	queue := []*layoutgraph.Tree{root}
	for len(queue) > 0 {
		current := queue[0]
		queue = queue[1:]
		for _, child := range current.Children {
			descendants = append(descendants, child)
			queue = append(queue, child)
		}
	}
	return descendants
}

The pages are generated with Golds v0.8.7. (GOOS=linux GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @zigo_101 (reachable from the left QR code) to get the latest news of Golds.