MKGraph.hpp

Go to the documentation of this file.

#ifndef MESHKIT_MKGRAPH_HPP
#define MESHKIT_MKGRAPH_HPP

#include "lemon/list_graph.h"
#include "lemon/bfs.h"

namespace MeshKit {

class MeshOp;
class GraphNode;
    
class MKGraph
{
public:

  MKGraph();
  
  virtual ~MKGraph();

  void clear_graph();
  
  void print_graph(const char * filename = NULL);
  
  void print_bfs_graph();

  lemon::ListDigraph &get_graph();

  const lemon::ListDigraph &get_graph() const;

  GraphNode *root_node() const;
  
  GraphNode *leaf_node() const;

  lemon::ListDigraph::NodeMap<GraphNode*> &node_map();

  const lemon::ListDigraph::NodeMap<GraphNode*> &node_map() const;

  MeshOp *get_meshop(lemon::ListDigraph::Node node) const;
  
  GraphNode *get_node(lemon::ListDigraph::Node node) const;
  
  GraphNode *source(lemon::ListDigraph::Arc arc) const;
  
  GraphNode *target(lemon::ListDigraph::Arc arc) const;

  GraphNode *other_node(lemon::ListDigraph::Arc arc, GraphNode *node) const;
  
  GraphNode *find_node(std::string op_name) const;

  MeshOp *find_meshop(std::string op_name) const;

  void insert_node(GraphNode *inserted, GraphNode *before, GraphNode *after= NULL);

  void add_arc(GraphNode *source, GraphNode *target);
  
  virtual void setup(bool reset = true);

  virtual void execute();

  virtual void setup_and_execute();

  // run execute on all nodes before this node (it may be a second run)
  virtual void execute_before(GraphNode * upto);

protected:
  lemon::ListDigraph mkGraph;

  GraphNode *rootNode, *leafNode;

  lemon::ListDigraph::NodeMap<GraphNode*> nodeMap;

private:

  MKGraph(const MKGraph &);
  
};

inline const lemon::ListDigraph &MKGraph::get_graph() const
{
  return mkGraph;
}

inline lemon::ListDigraph &MKGraph::get_graph()
{
  return mkGraph;
}

inline GraphNode *MKGraph::root_node() const
{
  return rootNode;
}

inline GraphNode *MKGraph::leaf_node() const
{
  return leafNode;
}
  
inline const lemon::ListDigraph::NodeMap<GraphNode*> &MKGraph::node_map() const
{
  return nodeMap;
}
  
inline lemon::ListDigraph::NodeMap<GraphNode*> &MKGraph::node_map() 
{
  return nodeMap;
}
  
inline GraphNode *MKGraph::get_node(lemon::ListDigraph::Node node) const
{
  return nodeMap[node];
}
  
inline GraphNode *MKGraph::source(lemon::ListDigraph::Arc arc) const
{
  return nodeMap[mkGraph.source(arc)];
}

inline GraphNode *MKGraph::target(lemon::ListDigraph::Arc arc) const
{
  return nodeMap[mkGraph.target(arc)];
}
  
inline void MKGraph::setup_and_execute() 
{
  setup();
  
  execute();
}

} // namespace MeshKit

#endif