graph

type ConfigGraph interface {
	graph.Directed
	graph.NodeRemover
}

type ConfigGraphPerEnvironment map[string]*simple.DirectedGraph

type ConfigNode struct {
	NodeID      int64
	Config      *config.Config
	DOTEncoding string
}

type CyclicDependencyError struct {
	//The Environment for which the error occurred.
	Environment string `json:"environment"`
	//A slice of all dependency cycles between configurations as slices of DependencyLocation. Each cycle slice is returned in order of dependencies.
	ConfigsInDependencyCycle [][]DependencyLocation `json:"configsInDependencyCycle"`
}

type DependencyLocation struct {
	// The coordinate.Coordinate of the configuration that is part of a Dependency Cycle
	Coordinate coordinate.Coordinate `json:"coordinate"`
	// The filepath this configuration was loaded from. May be empty.
	Filepath string `json:"filepath,omitempty"`
}

type NodeOption func(n *ConfigNode)

type SortedComponent struct {
	// Graph is a directed graph representation of the weakly connected component/sub-graph found in another graph.
	Graph *simple.DirectedGraph
	// SortedNodes are a topologically sorted slice of graph.Node s, which can be deployed in order.
	// This exists for convenience, so callers of GetIndependentlySortedConfigs can work with the component without implementing graph algorithms.
	SortedNodes []graph.Node
}

type SortingErrors []error