Rev | Line | |
---|
[1412] | 1 | // -*- C++ -*- //
|
---|
| 2 |
|
---|
| 3 | #ifndef MAPSTORAGE_H
|
---|
| 4 | #define MAPSTORAGE_H
|
---|
| 5 |
|
---|
| 6 | #include <all_include.h>
|
---|
| 7 |
|
---|
| 8 | class MapStorage
|
---|
| 9 | {
|
---|
| 10 |
|
---|
| 11 | public: ///!!!!!!!!
|
---|
| 12 | Graph g;
|
---|
| 13 | std::map< std::string,Graph::NodeMap<double> * > nodemap_storage;
|
---|
| 14 | std::map< std::string,Graph::EdgeMap<double> * > edgemap_storage;
|
---|
| 15 |
|
---|
| 16 | std::vector<Graph::NodeMap<double> > default_nodemaps;
|
---|
| 17 | std::vector<Graph::EdgeMap<double> > default_edgemaps;
|
---|
| 18 |
|
---|
| 19 | public:
|
---|
| 20 | MapStorage(Graph &);
|
---|
| 21 | int addNodeMap(const std::string &,Graph::NodeMap<double> *);
|
---|
| 22 | int addEdgeMap(const std::string &,Graph::EdgeMap<double> *);
|
---|
| 23 |
|
---|
| 24 | int numOfNodeMaps() {return nodemap_storage.size();};
|
---|
| 25 | int numOfEdgeMaps() {return edgemap_storage.size();};
|
---|
| 26 |
|
---|
| 27 | double maxOfNodeMap(const std::string &);
|
---|
| 28 | double maxOfEdgeMap(const std::string &);
|
---|
| 29 |
|
---|
| 30 | double minOfNodeMap(const std::string &);
|
---|
| 31 | double minOfEdgeMap(const std::string &);
|
---|
| 32 |
|
---|
| 33 | std::map< std::string,Graph::NodeMap<double> * >::iterator beginOfNodeMaps(){return nodemap_storage.begin();};
|
---|
| 34 | std::map< std::string,Graph::EdgeMap<double> * >::iterator beginOfEdgeMaps(){return edgemap_storage.begin();};
|
---|
| 35 | };
|
---|
| 36 |
|
---|
| 37 | #endif //MAPSTORAGE_H
|
---|
Note: See
TracBrowser
for help on using the repository browser.