DagOfTasks.h

 
#ifndef WRENCH_DAGOFTASKS_H
#define WRENCH_DAGOFTASKS_H
 
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/breadth_first_search.hpp>
#include <iostream>
 
#include <wrench/workflow/WorkflowTask.h>
 
namespace wrench {
 
/***********************/
/***********************/
 
    class WorkflowTask;
 
    struct VertexProperties {
//    std::size_t index;
//    boost::default_color_type color;
        const WorkflowTask *task;
    };
 
    typedef boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, VertexProperties> DAG;
 
    typedef unsigned long vertex_t;  // To clean up some day...
 
    class DagOfTasks {
 
    public:
 
        void addVertex(const WorkflowTask *task);
 
        void removeVertex(WorkflowTask *task);
 
        void addEdge(WorkflowTask *src, WorkflowTask *dst);
 
        void removeEdge(WorkflowTask *src, WorkflowTask *dst);
 
        bool doesPathExist(const WorkflowTask *src, const WorkflowTask *dst);
        bool doesEdgeExist(const WorkflowTask *src, const WorkflowTask *dst);
 
        long getNumberOfChildren(const WorkflowTask *task);
 
        std::vector<WorkflowTask *> getChildren(const WorkflowTask *task);
 
        long getNumberOfParents(const WorkflowTask *task);
 
        std::vector<WorkflowTask *> getParents(const WorkflowTask *task);
 
    private:
 
        class custom_bfs_visitor : public boost::default_bfs_visitor {
        public:
 
            const WorkflowTask *target_task;
 
            explicit custom_bfs_visitor(const WorkflowTask *target_task) : boost::default_bfs_visitor() {
                this->target_task = target_task;
            }
 
            template<typename Vertex, typename Graph>
            void discover_vertex(Vertex u,  Graph &g) {
                if (g[u].task == target_task) {
                    throw std::runtime_error("path found");
                }
            }
        };
 
        std::vector<const WorkflowTask*> task_list;
        std::unordered_map<const WorkflowTask *, unsigned long> task_map;
 
        DAG dag;
 
    };
 
/***********************/
/***********************/
 
}
 
 
#endif //WRENCH_DAGOFTASKS_H