|
Rosetta
|
Directed graph for representing the relationship between batches of jobs. More...
#include <protocols/jd3/JobDigraph.fwd.hh>#include <utility/graph/Digraph.hh>#include <core/types.hh>Classes | |
| class | protocols::jd3::JobDirectedNode |
| A node to use in JobDigraphs that holds information about how much work has completed for the set of jobs that it represents. More... | |
| class | protocols::jd3::JobDirectedEdge |
| A run-of-the-mill directed edge to use in JobDigraphs. More... | |
| class | protocols::jd3::JobDigraph |
| A Digraph for storing the relationship between groups of jobs, so that each node in this graph represents a group of jobs, and if the outputs from one group are inputs to another group, then a directed edge from the first group to the second group will be in the graph. The JobDistributor will run all of the jobs in the first group before any of the jobs in the second group will start. More... | |
| class | protocols::jd3::JobDigraphUpdater |
| This class defines the set of operations that a JobQueen can perform to update the JobDigraph that she originally gave to the JobDistributor. In particular, the JobQueen may only update the JobDigraph by adding new nodes to the graph (which will receive incrementally larger indexes) and then adding edges to the graph such that the head node for the edge must land on one of the newly added nodes in the graph. The JobDistributor will hand the JobQueen a JobDigraphUpdater through the JobQueen's update_job_digraph method, and in this call, the JobQueen may add as many nodes as she wishes, and as many edges that land on those new nodes, but when the method exits, those nodes petrify: the JobQueen may not add any more edges that land on those new nodes. More... | |
Namespaces | |
| protocols | |
| The instance of Loops contained by AbrelaxApplication should be replaced by a LoopsOP. | |
| protocols::jd3 | |
Directed graph for representing the relationship between batches of jobs.
1.9.1