WorkGraph.h

Go to the documentation of this file.

#ifndef WORKGRAPH_H_
#define WORKGRAPH_H_
 
#include "MUQ/Modeling/NodeNameFinder.h"
 
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/filtered_graph.hpp>
 
#include <memory>
 
namespace muq {
  namespace Modeling {
 
    class WorkGraphPiece;
    class WorkPiece;
    class ConstantPiece;
    class ModGraphPiece;
 
    class WorkGraph {
    public:
      friend class WorkGraphPiece;
      friend class ModGraphPiece;
 
      WorkGraph();
 
      virtual ~WorkGraph();
 
      virtual std::shared_ptr<WorkGraph> Clone() const;
 
 
      unsigned int NumNodes() const;
 
 
      unsigned int NumEdges() const;
 
 
      void AddNode(std::shared_ptr<WorkPiece> input, std::string const& name);
 
      void RemoveNode(std::string const& name);
 
 
      void AddEdge(std::string const& nameFrom, unsigned int const outputDim, std::string const& nameTo, unsigned int const inputDim);
 
 
      bool HasNode(std::string const& name) const;
 
      std::vector<std::pair<int,int>> GetEdges(std::string const& srcName, std::string const& tgtName);
 
 
      void Visualize(std::string const& filename) const;
 
      std::vector<std::string> GetParents(std::string const& name) const;
 
      std::string GetParent(std::string const& name, int inputIndex) const;
 
      std::vector<std::string> GetChildren(std::string const& name) const;
 
 
      std::shared_ptr<WorkGraph> DependentCut(std::string const& nameOut) const;
 
 
      std::shared_ptr<WorkGraphPiece> CreateWorkPiece(std::string const& node) const;
 
 
      std::shared_ptr<ModGraphPiece> CreateModPiece(std::string const& node, std::vector<std::string> const& inNames = std::vector<std::string>()) const;
 
 
      bool Constant(std::string const& node) const;
 
 
      std::vector<boost::any> const& GetConstantOutputs(std::string const& node) const;
 
      std::shared_ptr<WorkPiece> GetPiece(std::string const& name);
 
      std::string GetName(std::shared_ptr<WorkPiece> piece) const;
 
 
      void Print(std::ostream& fout=std::cout) const;
 
 
      std::vector<std::pair<std::string, int> > GetInputNames() const;
 
 
      std::vector<std::pair<std::string, int> > GetOutputNames() const;
 
      void BindNode(std::string             const& nodeName,
                    std::vector<boost::any> const& x);
 
      void BindEdge(std::string const& nodeName,
                    unsigned int       inputDim,
                    boost::any  const& x);
 
    private:
 
 
      std::vector<boost::any>& GetConstantOutputs(boost::graph_traits<Graph>::vertex_descriptor const& node) const;
 
 
      bool Constant(boost::graph_traits<Graph>::vertex_descriptor const& node) const;
 
      std::shared_ptr<WorkPiece> GetPiece(boost::graph_traits<Graph>::vertex_descriptor it);
 
 
      void RecursiveCut(const boost::graph_traits<Graph>::vertex_descriptor& vOld, const boost::graph_traits<Graph>::vertex_descriptor& vNew, std::shared_ptr<WorkGraph>& newGraph) const;
 
 
      bool HasNode(boost::graph_traits<Graph>::vertex_iterator& iter, std::string const& name) const;
 
 
      bool HasEdge(boost::graph_traits<Graph>::vertex_descriptor const& vOut, boost::graph_traits<Graph>::vertex_descriptor const& vIn, int const inputDim) const;
 
 
      boost::graph_traits<Graph>::vertex_iterator GetNodeIterator(std::string const& name) const;
      boost::graph_traits<Graph>::vertex_iterator GetNodeIterator(std::shared_ptr<WorkPiece> piece) const;
 
 
      std::vector<std::pair<boost::graph_traits<Graph>::vertex_descriptor, int> > GraphInputs() const;
 
 
      std::vector<std::pair<boost::graph_traits<Graph>::vertex_descriptor, int> > GraphOutputs() const;
 
      Graph graph;
    };
  } // namespace Modeling
} // namespace muq
 
#endif