Open In App
Related Articles

Map of Vectors in C++ STL with Examples

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report
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. Syntax:
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.
// C++ program to demonstrate
// use of map for vectors
  
#include <bits/stdc++.h>
using namespace std;
  
map<vector<int>, int> vis;
  
// Print True if vector is visited
// or False if not visited
void CheckVisited(vector<int> data)
{
    if (vis.find(data) != vis.end()) {
        cout << "True" << endl;
    }
    else {
        cout << "False" << endl;
    }
}
  
// Driver code
int main()
{
    // Initializing some vectors
    vector<int> data_1{ 10, 20, 30, 40 };
    vector<int> data_2{ 5, 10, 15 };
    vector<int> data_3{ 1, 3, 5, 7, 9, 11, 13 };
  
    // Making some vectors as visited
    vis[data_1] = 1;
    vis[data_2] = 1;
    vis[data_3] = 1;
  
    // checking if these vectors are
    // visited or not
    vector<int> check_1 = { 5, 10, 15 };
    vector<int> check_2 = { 2, 4, 6, 8, 10, 12 };
  
    CheckVisited(check_1);
    CheckVisited(check_2);
  
    return 0;
}

                    
Output:
True
False


Last Updated : 16 Jan, 2020
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads