ladanyi@1412: // -*- C++ -*- //
ladanyi@1412: 
ladanyi@1412: #ifndef MAPSTORAGE_H
ladanyi@1412: #define MAPSTORAGE_H
ladanyi@1412: 
ladanyi@1412: #include <all_include.h>
ladanyi@1412: 
ladanyi@1412: class MapStorage
ladanyi@1412: {
ladanyi@1412: 
ladanyi@1412: public: ///!!!!!!!!
ladanyi@1412:   Graph g;
ladanyi@1412:   std::map< std::string,Graph::NodeMap<double> * > nodemap_storage;
ladanyi@1412:   std::map< std::string,Graph::EdgeMap<double> * > edgemap_storage;
ladanyi@1412: 
ladanyi@1412:   std::vector<Graph::NodeMap<double> > default_nodemaps;
ladanyi@1412:   std::vector<Graph::EdgeMap<double> > default_edgemaps;
ladanyi@1412: 
ladanyi@1412: public:
ladanyi@1412:   MapStorage(Graph &);
ladanyi@1412:   int addNodeMap(const std::string &,Graph::NodeMap<double> *);
ladanyi@1412:   int addEdgeMap(const std::string &,Graph::EdgeMap<double> *);
ladanyi@1412: 
ladanyi@1412:   int numOfNodeMaps() {return nodemap_storage.size();};
ladanyi@1412:   int numOfEdgeMaps() {return edgemap_storage.size();};
ladanyi@1412: 
ladanyi@1412:   double maxOfNodeMap(const std::string &);
ladanyi@1412:   double maxOfEdgeMap(const std::string &);
ladanyi@1412: 
ladanyi@1412:   double minOfNodeMap(const std::string &);
ladanyi@1412:   double minOfEdgeMap(const std::string &);
ladanyi@1412: 
ladanyi@1412:   std::map< std::string,Graph::NodeMap<double> * >::iterator beginOfNodeMaps(){return nodemap_storage.begin();};
ladanyi@1412:   std::map< std::string,Graph::EdgeMap<double> * >::iterator beginOfEdgeMaps(){return edgemap_storage.begin();};
ladanyi@1412: };
ladanyi@1412: 
ladanyi@1412: #endif //MAPSTORAGE_H