Notes

#include <iostream>
#include <vector>
#include <string>
using namespace std;

// data structure to store graph edges
struct Edge {
int src, dest, weight;
};

typedef pair<int, int> Pair;

// class to represent a graph object
class Graph
{
public:
// construct a vector of vectors of Pairs to represent an adjacency list
vector<vector<Pair>> adjList;

// Graph Constructor
Graph(vector<Edge> const &edges, int N)
{
// resize the vector to N elements of type vector<Pair>
adjList.resize(N);

// add edges to the directed graph
for (auto &edge : edges)
{
int src = edge.src;
int dest = edge.dest;
int weight = edge.weight;

// insert at the end
adjList[src].push_back(make_pair(dest, weight));

}
}
};

string p1;
string arar[] = { "AAMIR FAROOQ KHAN", "ABDUL MOIZ", "ABDUL REHMAN", "ABDUL HAFEEZ SAJID", "ABDULLAH NASIR" };
void persons(int sum, int created){
p1 = arar[created];
cout << p1 << " has post with " << sum << " likes" << endl;
}

// print adjacency list representation of graph

int sum[5];
int like,created;
void printGraph(Graph const &graph, int N)
{
for (int i = 0; i < N; i++)
{
sum[i] = 0;
// print all neighboring vertices of given vertex
for (Pair v : graph.adjList[i]){
sum[v.first] += v.second;
}
cout << endl;
}
for (int i=0; i< 5; i++){
if (sum[i]>10){
persons(sum[i], i);
}
}
}


// Graph Implementation using STL
int main()
{
// vector of graph edges as per above diagram.
// Please note that initialization vector in below format will
// work fine in C++11, C++14, C++17 but will fail in C++98.
vector<Edge> edges =
{
// (x, y, w) -> edge from x to y having weight w
{ 0, 0, 20 }, { 0, 4, 7 }, { 2, 2, 1 }, { 3, 0, 21 },
{ 4, 3, 17 }
};

// Number of nodes in the graph
int N = 6;

// construct graph
Graph graph(edges, N);

// print adjacency list representation of graph
printGraph(graph, N);

system("pause");
return 0;
}