src/server/pkg/dag/dag.go
func (d *DAG) Descendants(id string, to []string) []string {
	seen := make(map[string]bool)
	for _, toID := range to {
		seen[toID] = true
	}
	return bfs(id, d.children, seen)
}
func (d *DAG) Descendants(id string, to []string) []string {
	seen := make(map[string]bool)
	for _, toID := range to {
		seen[toID] = true
	}
	return bfs(id, d.children, seen)
}
func ( d * DAG ) Descendants ( id string , to [ ] string ) [ ] string { seen := make ( map [ string ] bool ) for _ , toID := range to { seen [ toID ] = true } return bfs ( id , d . children , seen ) }
// Descendants returns a slice containing all descendants of a node, 'id',
// in d which are an ancestor of at least one of the nodes in 'to'.
Descendants returns a slice containing all descendants of a node id in d which are an ancestor of at least one of the nodes in to .