An internal class that uses the Boost Graph Library to implement a DAG of WorkflowTask objects. More...
#include <DagOfTasks.h>
Public Member Functions | |
void | addEdge (WorkflowTask *src, WorkflowTask *dst) |
Method to add an edge between to task vertices. More... | |
void | addVertex (const WorkflowTask *task) |
Method to add a task vertex to the DAG. More... | |
bool | doesEdgeExist (const WorkflowTask *src, const WorkflowTask *dst) |
Method to check whether an edge exists between to task vertices. More... | |
bool | doesPathExist (const WorkflowTask *src, const WorkflowTask *dst) |
Method to check whether a path exists between to task vertices. More... | |
std::vector< WorkflowTask * > | getChildren (const WorkflowTask *task) |
Method to get the children of a task vertex. More... | |
long | getNumberOfChildren (const WorkflowTask *task) |
Method to get the number of children of a task vertex. More... | |
long | getNumberOfParents (const WorkflowTask *task) |
Method to get the number of parents of a task vertex. More... | |
std::vector< WorkflowTask * > | getParents (const WorkflowTask *task) |
Method to get the parents of a task vertex. More... | |
void | removeEdge (WorkflowTask *src, WorkflowTask *dst) |
Remove an edge between two task vertices. More... | |
void | removeVertex (WorkflowTask *task) |
Method to remove a task vertex from the DAG. More... | |
Detailed Description
An internal class that uses the Boost Graph Library to implement a DAG of WorkflowTask objects.
Member Function Documentation
◆ addEdge()
void wrench::DagOfTasks::addEdge | ( | wrench::WorkflowTask * | src, |
wrench::WorkflowTask * | dst | ||
) |
Method to add an edge between to task vertices.
- Parameters
-
src the source task dst the destination task
◆ addVertex()
void wrench::DagOfTasks::addVertex | ( | const WorkflowTask * | task | ) |
Method to add a task vertex to the DAG.
- Parameters
-
task the task
◆ doesEdgeExist()
bool wrench::DagOfTasks::doesEdgeExist | ( | const WorkflowTask * | src, |
const WorkflowTask * | dst | ||
) |
Method to check whether an edge exists between to task vertices.
- Parameters
-
src the source task dst the destination task
- Returns
- true if there is a path between the tasks
◆ doesPathExist()
bool wrench::DagOfTasks::doesPathExist | ( | const WorkflowTask * | src, |
const WorkflowTask * | dst | ||
) |
Method to check whether a path exists between to task vertices.
- Parameters
-
src the source task dst the destination task
- Returns
- true if there is a path between the tasks
◆ getChildren()
std::vector< WorkflowTask * > wrench::DagOfTasks::getChildren | ( | const WorkflowTask * | task | ) |
Method to get the children of a task vertex.
- Parameters
-
task the task
- Returns
- the children
◆ getNumberOfChildren()
long wrench::DagOfTasks::getNumberOfChildren | ( | const WorkflowTask * | task | ) |
Method to get the number of children of a task vertex.
- Parameters
-
task the task
- Returns
- a number children
◆ getNumberOfParents()
long wrench::DagOfTasks::getNumberOfParents | ( | const WorkflowTask * | task | ) |
Method to get the number of parents of a task vertex.
- Parameters
-
task the task
- Returns
- a number parents
◆ getParents()
std::vector< WorkflowTask * > wrench::DagOfTasks::getParents | ( | const WorkflowTask * | task | ) |
Method to get the parents of a task vertex.
- Parameters
-
task the task
- Returns
- the parents
◆ removeEdge()
void wrench::DagOfTasks::removeEdge | ( | wrench::WorkflowTask * | src, |
wrench::WorkflowTask * | dst | ||
) |
Remove an edge between two task vertices.
- Parameters
-
src the source task dst the destination task
◆ removeVertex()
void wrench::DagOfTasks::removeVertex | ( | wrench::WorkflowTask * | task | ) |
Method to remove a task vertex from the DAG.
- Parameters
-
task the task
The documentation for this class was generated from the following files:
- DagOfTasks.h
- DagOfTasks.cpp