graph_properties.h

#ifndef GRAPH_PROPERTIES_H_
#define GRAPH_PROPERTIES_H_

#include "grapher.h"

template<typename GraphType> 
class GraphProperties {
  public:
    typedef typename GraphType::node_value_type V_type;
    typedef typename GraphType::edge_value_type E_type;
    typedef typename GraphType::index_type_t index_type_t;
    typedef typename GraphType::property_map_t property_map_t;
    typedef typename GraphType::node_property_map_t node_property_map_t;
    typedef typename GraphType::edge_property_map_t edge_property_map_t;

    ~GraphProperties() {
      // delete every map in node property map
      typename node_property_map_t::iterator it = node_property_map_.begin();
      for (; it != node_property_map_.end(); it++) {
        delete it->second;
      }

      // delete every map in edge property map
      typename edge_property_map_t::iterator edge_it = edge_property_map_.begin();
      for (; edge_it != edge_property_map_.end(); edge_it++) {
        delete edge_it->second;
      }
    }

    void set_property(V_type node, std::string property, std::string value) {
      typename node_property_map_t::iterator it = node_property_map_.find(node);

      property_map_t* n = 0;
      if (it != node_property_map_.end()) {
        n = it->second;
      } else {
        n = new property_map_t();
        node_property_map_.insert(node_property_map_.end(), std::make_pair(node, n));
      }
      (*n)[property] = value;
    }

    void set_property(E_type edge, std::string property, std::string value) {
      typename edge_property_map_t::iterator it = edge_property_map_.find(edge);

      property_map_t* prop_map = 0;
      if (it != edge_property_map_.end()) {
        prop_map = it->second;
      
      } else {
        prop_map = new property_map_t();
        edge_property_map_.insert(edge_property_map_.end(), std::make_pair(edge, prop_map));

        (*prop_map)[property] = value;
      }
    }

    std::string get_property(V_type node, std::string property) {
      typename node_property_map_t::iterator it = node_property_map_.find(node);

      if (it != node_property_map_.end()) {
        property_map_t property_map = *node_property_map_[node];

        typename property_map_t::iterator it2 = property_map.find(property);

        if (it2 != property_map.end()) {
          return property_map[property];
        }
      }

      return "";
    }

    std::string get_property(E_type edge, std::string property) {
      typename edge_property_map_t::iterator it = edge_property_map_.find(edge);

      if (it != edge_property_map_.end()) {
        property_map_t property_map = *edge_property_map_[edge];

        typename property_map_t::iterator it2 = property_map.find(property);

        if (it2 != property_map.end()) {
          return property_map[property];
        } 
      }

      return "";
    }

    property_map_t* get_all_properties(V_type node) {
      typename node_property_map_t::iterator it = node_property_map_.find(node);

      if (it != node_property_map_.end()) {
        return node_property_map_[node];
      }

      return NULL;
    }

    property_map_t* get_all_properties(E_type edge) {
      typename edge_property_map_t::iterator it = edge_property_map_.find(edge);

      if (it != edge_property_map_.end()) {
        return edge_property_map_[edge];
      }

      return NULL;
    }

    void clear() {
      typename node_property_map_t::iterator it = node_property_map_.begin();
      for (; it != node_property_map_.end(); it++) {
        delete it->second;
      }
      node_property_map_.clear();

      typename edge_property_map_t::iterator edge_it = edge_property_map_.begin();

      for (; edge_it != edge_property_map_.end(); edge_it++) {
        delete edge_it->second;
      }
      edge_property_map_.clear();
    }

  private:
      node_property_map_t node_property_map_;

      edge_property_map_t edge_property_map_;

};

#endif