Stree.hh

Go to the documentation of this file.

#ifndef STREE_H_
#define STREE_H_
 
#include <vector>
#include <set>
#include <string>
#include <sstream>
#include "State.hh"
 
class Stree {
public:
  Stree(void);
  int size(void) const { return numNodes; }
  std::set<State> getLabel(int node) const {return label[node]; }
  void setLabel(int node, std::set<State> newlabel) { label[node] = newlabel; }
  void addLastChild(int parent, std::set<State> const & childLabel);
  void removeSubtree(int node);
  void makeContiguous(void);
  void restrictLabels(void);
  bool isGreen(int node) const;
  void removeDescendants(int node);
  void preorder(std::vector<int> &order) const;
  bool isIsomorphic(Stree const &other, int root = 0, int otherRoot = 0) const;
  std::string toString(void) const;
  std::string toDot(std::string graphname = std::string("tree"),
                    std::string subgraph = std::string("")) const;
  static int constexpr undef = -1;
private:
  bool isDefined(int node) const { return node != undef; }
  void restrictLabelsRecur(int node, std::set<State> & subset);
  void preorderRecur(std::vector<int> &order, int node = 0) const;
  void toStringRecur(int node, std::ostringstream & oss) const;
  size_t numNodes;
  std::vector< std::set<State> > label;
  std::vector<int> parent;
  std::vector<int> elder;
  std::vector<int> younger;
  std::vector<int> lastChild;
};
 
std::ostream & operator<<(std::ostream & os, Stree const & t);
 
#endif