author | athos |
Thu, 26 May 2005 12:16:16 +0000 | |
changeset 1436 | e0beb94d08bf |
parent 1412 | c7fab5a1174a |
child 1440 | 3d2e3cfb2a6c |
permissions | -rw-r--r-- |
ladanyi@1412 | 1 |
// -*- C++ -*- // |
ladanyi@1412 | 2 |
|
ladanyi@1412 | 3 |
#ifndef MAPSTORAGE_H |
ladanyi@1412 | 4 |
#define MAPSTORAGE_H |
ladanyi@1412 | 5 |
|
ladanyi@1412 | 6 |
#include <all_include.h> |
ladanyi@1412 | 7 |
|
ladanyi@1412 | 8 |
class MapStorage |
ladanyi@1412 | 9 |
{ |
ladanyi@1412 | 10 |
|
ladanyi@1412 | 11 |
public: ///!!!!!!!! |
ladanyi@1412 | 12 |
Graph g; |
ladanyi@1412 | 13 |
std::map< std::string,Graph::NodeMap<double> * > nodemap_storage; |
ladanyi@1412 | 14 |
std::map< std::string,Graph::EdgeMap<double> * > edgemap_storage; |
ladanyi@1412 | 15 |
|
ladanyi@1412 | 16 |
std::vector<Graph::NodeMap<double> > default_nodemaps; |
ladanyi@1412 | 17 |
std::vector<Graph::EdgeMap<double> > default_edgemaps; |
ladanyi@1412 | 18 |
|
ladanyi@1412 | 19 |
public: |
ladanyi@1412 | 20 |
MapStorage(Graph &); |
ladanyi@1412 | 21 |
int addNodeMap(const std::string &,Graph::NodeMap<double> *); |
ladanyi@1412 | 22 |
int addEdgeMap(const std::string &,Graph::EdgeMap<double> *); |
ladanyi@1412 | 23 |
|
ladanyi@1412 | 24 |
int numOfNodeMaps() {return nodemap_storage.size();}; |
ladanyi@1412 | 25 |
int numOfEdgeMaps() {return edgemap_storage.size();}; |
ladanyi@1412 | 26 |
|
ladanyi@1412 | 27 |
double maxOfNodeMap(const std::string &); |
ladanyi@1412 | 28 |
double maxOfEdgeMap(const std::string &); |
ladanyi@1412 | 29 |
|
ladanyi@1412 | 30 |
double minOfNodeMap(const std::string &); |
ladanyi@1412 | 31 |
double minOfEdgeMap(const std::string &); |
ladanyi@1412 | 32 |
|
ladanyi@1412 | 33 |
std::map< std::string,Graph::NodeMap<double> * >::iterator beginOfNodeMaps(){return nodemap_storage.begin();}; |
ladanyi@1412 | 34 |
std::map< std::string,Graph::EdgeMap<double> * >::iterator beginOfEdgeMaps(){return edgemap_storage.begin();}; |
ladanyi@1412 | 35 |
}; |
ladanyi@1412 | 36 |
|
ladanyi@1412 | 37 |
#endif //MAPSTORAGE_H |