Transpose of a directed graph

#include <bits/stdc++.h>
using namespace std;

void addEdge(vector<int> adj[], int src, int dest)
{
    adj[src].push_back(dest);
}

void displayGraph(vector<int> adj[], int v)
{
    for (int i = 0; i < v; i++) {
        cout << i << "--> ";
        for (int j = 0; j < adj[i].size(); j++)
            cout << adj[i][j] << " ";
        cout << "\n";
    }
}
void transposeGraph(vector<int> adj[], vector<int> transpose[], int v)
{
    for (int i = 0; i < v; i++)
        for (int j = 0; j < adj[i].size(); j++)
            addEdge(transpose, adj[i][j], i);
}

int main()
{
    int v = 5;
    vector<int> adj[v];
    addEdge(adj, 0, 1);
    addEdge(adj, 0, 4);
    addEdge(adj, 0, 3);
    addEdge(adj, 2, 0);
    addEdge(adj, 3, 2);
    addEdge(adj, 4, 1);
    addEdge(adj, 4, 3);

    vector<int> transpose[v];
    transposeGraph(adj, transpose, v);
    displayGraph(transpose, v);

    return 0;
}