Map in STL Maps are associative containers that store elements in a mapped fashion. Each element has a key value and a mapped value. No two mapped values can have same key values.
Vector in STL Vector is same as dynamic arrays with the ability to resize itself automatically when an element is inserted or deleted, with their storage being handled automatically by the container. Vector elements are placed in contiguous storage so that they can be accessed and traversed using iterators.
Map of Vectors in STL: Map of Vectors can be very efficient in designing complex data structures.
map<key, vector<datatype>> map_of_vector; OR map<vector<datatype>, key> map_of_vector;
For example: Consider a simple problem where we have to check if a vector is visited or not.
Rated as one of the most sought after skills in the industry, own the basics of coding with our C++ STL Course and master the very concepts by intense problem-solving.
- Vector of Vectors in C++ STL with Examples
- map::at() and map::swap() in C++ STL
- Quickly check if two STL vectors contain same elements or not
- Working with Array and Vectors using STL in C++
- How to join two Vectors using STL in C++?
- Array of Vectors in C++ STL
- Searching in a map using std::map functions in C++
- Difference between std::remove and vector::erase for vectors
- How to flatten a Vector of Vectors or 2D Vector in C++
- Implementation of file allocation methods using vectors
- Descending order in Map and Multimap of C++ STL
- Map in C++ Standard Template Library (STL)
- Hash Table vs STL Map
- Map of pairs in STL
- Traversing a map (or unordered_map) in C++ STL
- map::clear() in C++ STL
- map::size() in C++ STL
- map::begin() and end() in C++ STL
- map::empty() in C++ STL
- map::operator in C++ STL
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.