1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/mapstorage.h	Wed May 11 16:55:18 2005 +0000
     1.3 @@ -0,0 +1,37 @@
     1.4 +// -*- C++ -*- //
     1.5 +
     1.6 +#ifndef MAPSTORAGE_H
     1.7 +#define MAPSTORAGE_H
     1.8 +
     1.9 +#include <all_include.h>
    1.10 +
    1.11 +class MapStorage
    1.12 +{
    1.13 +
    1.14 +public: ///!!!!!!!!
    1.15 +  Graph g;
    1.16 +  std::map< std::string,Graph::NodeMap<double> * > nodemap_storage;
    1.17 +  std::map< std::string,Graph::EdgeMap<double> * > edgemap_storage;
    1.18 +
    1.19 +  std::vector<Graph::NodeMap<double> > default_nodemaps;
    1.20 +  std::vector<Graph::EdgeMap<double> > default_edgemaps;
    1.21 +
    1.22 +public:
    1.23 +  MapStorage(Graph &);
    1.24 +  int addNodeMap(const std::string &,Graph::NodeMap<double> *);
    1.25 +  int addEdgeMap(const std::string &,Graph::EdgeMap<double> *);
    1.26 +
    1.27 +  int numOfNodeMaps() {return nodemap_storage.size();};
    1.28 +  int numOfEdgeMaps() {return edgemap_storage.size();};
    1.29 +
    1.30 +  double maxOfNodeMap(const std::string &);
    1.31 +  double maxOfEdgeMap(const std::string &);
    1.32 +
    1.33 +  double minOfNodeMap(const std::string &);
    1.34 +  double minOfEdgeMap(const std::string &);
    1.35 +
    1.36 +  std::map< std::string,Graph::NodeMap<double> * >::iterator beginOfNodeMaps(){return nodemap_storage.begin();};
    1.37 +  std::map< std::string,Graph::EdgeMap<double> * >::iterator beginOfEdgeMaps(){return edgemap_storage.begin();};
    1.38 +};
    1.39 +
    1.40 +#endif //MAPSTORAGE_H