Is there a path from ‘self` to `other` following edges in the dependency graph? @return true iff there is a path following edges within this {#graph}
Sets up the resolution process @return [void]
@return [Conflict] a {Conflict} that reflects the failure to activate
the {#possibility} in conjunction with the current {#state}
Indicates progress roughly once every second @return [void]
Add the current {#possibility} to the dependency graph of the current {#state} @return [void]
Detaches the {#vertex_named} ‘name` {Vertex} from the graph, recursively removing any non-root vertices that were orphaned in the process @param [String] name @return [Array<Vertex>] the vertices which have been detached
Determines whether the given ‘requirement` is satisfied by the given `spec`, in the context of the current `activated` dependency graph.
@param [Object] requirement @param [DependencyGraph] activated the current dependency graph in the
resolution process.
@param [Object] spec @return [Boolean] whether ‘requirement` is satisfied by `spec` in the
context of the current `activated` dependency graph.
Adds this spec’s require paths to LOAD_PATH, in the proper location.
Reset nil attributes to their default values to make the spec valid
Raw Strings are JSON Objects (the raw bytes are stored in an array for the key “raw”). The Ruby String can be created by this module method.