equal
deleted
inserted
replaced
78 ///To be able to iterate through each maps this function returns an iterator pointing to the first nodemap in the storage. |
78 ///To be able to iterate through each maps this function returns an iterator pointing to the first nodemap in the storage. |
79 std::map< std::string,Graph::NodeMap<double> * >::iterator beginOfNodeMaps(){return nodemap_storage.begin();}; |
79 std::map< std::string,Graph::NodeMap<double> * >::iterator beginOfNodeMaps(){return nodemap_storage.begin();}; |
80 |
80 |
81 ///To be able to iterate through each maps this function returns an iterator pointing to the first edgemap in the storage. |
81 ///To be able to iterate through each maps this function returns an iterator pointing to the first edgemap in the storage. |
82 std::map< std::string,Graph::EdgeMap<double> * >::iterator beginOfEdgeMaps(){return edgemap_storage.begin();}; |
82 std::map< std::string,Graph::EdgeMap<double> * >::iterator beginOfEdgeMaps(){return edgemap_storage.begin();}; |
|
83 |
|
84 ///This function sets a default base value for the newly created node |
|
85 void init_maps_for_node(NodeIt); |
|
86 |
|
87 ///This function sets a default base value for the newly created node |
|
88 void init_maps_for_edge(Graph::Edge); |
83 }; |
89 }; |
84 |
90 |
85 #endif //MAPSTORAGE_H |
91 #endif //MAPSTORAGE_H |