Method visit

pkg/compose/dependencies.go:425–444

(key string, path []string, discovered []string, finished []string)

}

func (g *Graph) visit(key string, path []string, discovered []string, finished []string) ([]string, []string, error) {
	discovered = append(discovered, key)

	for _, v := range g.Vertices[key].Children {
		path := append(path, v.Key)
		if slices.Contains(discovered, v.Key) {
			return nil, nil, fmt.Errorf("cycle found: %s", strings.Join(path, " -> "))
		}

		if !slices.Contains(finished, v.Key) {
			if _, _, err := g.visit(v.Key, path, discovered, finished); err != nil {
				return nil, nil, err
			}
		}
	}

	discovered = slices.DeleteFunc(discovered, func(s string) bool { return s == key })
	finished = append(finished, key)
	return discovered, finished, nil
}