dagwood | For all your dependency graph needs

dagwood is a Ruby library. dagwood has no bugs, it has no vulnerabilities, it has a Permissive License and it has low support. You can download it from GitHub.

Dagwood allows you to determine the resolution order of dependencies, using a topologically sorted directed acyclic graph (DAG - get it?). What does this mean? Let's use an example. When making a sandwich, it is important to follow a specific order of operations. We know that the bread needs to be sliced before we can put the mustard on it, just like we know there is no point closing the sandwich before putting the smoked meat in it. By stating all these dependencies (e.g. add_mustard depends on slice_bread), we can determine the full, correct order in which we should make our sandwich. We call this a DependencyGraph. See the features listed below for ways in which we can use this information. Dagwood might be useful for scheduling Sidekiq jobs to run in a specific order, determining the order in which software packages must be installed on a server, figuring out how long a project might take based on which steps need to be completed first, and many more use cases. The basic case. Determine the order of dependencies, one item at a time. The order method returns an array of dependencies, in the order they need to be resolved. Sometimes certain dependencies can be resolved at the same time. For example, a friend is helping you make your sandwich and you can both complete certain steps at the same time. The parallel_order method functions very similarly to order, except the items in the array are "groups" of dependencies which can be resolved in parallel (in this example, add_smoked_meat and add_mustard can be done at the same time). The reverse_order method can be useful in cases where you'd like to apply the opposite order of operations. Perhaps you only care about what is needed to perform the add_mustard operation. The subgraph method allows you to grab a slice of the DependencyGraph, based on the given node. The merge method allows you to take two DependencyGraphs and merge them. If your two most beloved restaurants have really good sandwich recipes, perhaps you'd like to attempt creating the Ultimate Sandwich by combining the steps for making both?.