mirror of https://github.com/docker/compose.git
1f43b83409
The algorithm is like so: * get all the leaves of the graph, these are all the service that don't have any dependency * once a service is started we take the list of its parents (dependents) * if all the dependencies of each of those dependents are started then we can start it as well * if not then we continue to the next dependent Signed-off-by: Djordje Lukic <djordje.lukic@docker.com> |
||
|---|---|---|
| .. | ||
| e2e | ||
| backend.go | ||
| compose.go | ||
| compose_test.go | ||
| containers.go | ||
| convergence.go | ||
| convert.go | ||
| convert_test.go | ||
| dependencies.go | ||
| dependencies_test.go | ||
| doc.go | ||
| labels.go | ||
| util.go | ||
| volumes.go | ||