79 std::map<std::string, NBDistrict*>::const_iterator
begin()
const {
87 std::map<std::string, NBDistrict*>::const_iterator
end()
const {
124 bool addSink(
const std::string& dist,
NBEdge*
const destination,
A container for districts.
NBDistrictCont & operator=(const NBDistrictCont &s)
NBDistrict * retrieve(const std::string &id) const
Returns the districts with the given id.
NBDistrictCont()
Constructor.
DistrictCont myDistricts
The instance of the dictionary.
std::map< std::string, NBDistrict * >::const_iterator end() const
Returns the pointer to the end of the stored districts.
bool addSink(const std::string &dist, NBEdge *const destination, double weight)
Adds a sink to the named district.
std::map< std::string, NBDistrict * >::const_iterator begin() const
Returns the pointer to the begin of the stored districts.
bool insert(NBDistrict *const district)
Adds a district to the dictionary.
NBDistrictCont(const NBDistrictCont &s)
std::map< std::string, NBDistrict * > DistrictCont
The type of the dictionary where a node may be found by her id.
bool addSource(const std::string &dist, NBEdge *const source, double weight)
Adds a source to the named district.
void removeFromSinksAndSources(NBEdge *const e)
Removes the given edge from the lists of sources and sinks in all stored districts.
int size() const
Returns the number of districts inside the container.
~NBDistrictCont()
Destructor.
A class representing a single district.
The representation of a single edge during network building.
Container for nodes during the netbuilding process.
Static storage of an output device and its base (abstract) implementation.