Strongly Connected Component

-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-STRONGLY_CONNECTED_COMPONENT*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
#include<bits/stdc++.h>
using namespace std;
vector<int > adj[10];//Adjency List Representation
vector<int> adj_rev[10];
bool visit[10];
stack <int > mystack;

void set_false()
{
    for(int i=0;i<10;i++)
        visit[i]=false;//Mark visit array as False;
}
void dfs_order(int s)
{
    visit[s]=true;
    for(int i=0;i<adj[s].size();++i)
            if(visit[adj[s][i]]==false)
                dfs_order(adj[s][i]);
    mystack.push(s);
}
void dfs(int s)
{
    visit[s]=true;
    cout<<s<<" ";
    for(int i=0;i<adj_rev[s].size();++i)
            if(visit[adj_rev[s][i]]==false)
             dfs(adj_rev[s][i]);


}
int main()
{
    int node,edge,x,y,c=0;
    cin>>node>>edge;
    set_false();
    for(int i=0;i<edge;i++)
    {
     cin>>x>>y;
     adj[x].push_back(y);
     adj_rev[y].push_back(x);//Reverse of given graph
    }

 for(int i=1;i<=node;i++)
 if(visit[i]==false)
   dfs_order(i); // vertices in order of completion of the recursive calls.

   set_false();
   while(!mystack.empty())
   {
   int v=mystack.top();
     mystack.pop();
     if(visit[v]==false)
     {
        dfs(v);
        c++;
        cout<<"\n";
     }
   }
   cout<<"Number of Components :"<<c;
}
/*
4 5
1 2
2 3
3 1
1 4
3 4
out: 1 3 2
4
Number of Components :2
*/