BREADTH FIRST SEARCH USING adjacency LIST in GRAPH

#include <iostream>
#include <vector>
#include <fstream>
#include <list>
using namespace std;
int arrr[20],counter=0;
void BFS(int s,vector < vector < int > > v,bool c[200])
{
std::vector<int> queue;
queue.push_back(s);
list <int > queue1;
queue1.push_back(s);
c[s]=true;int i=0;

// std::vector<int > :: iterator s1;
s1=queue.begin();
int n=5;
while(!queue1.empty())
{
s=queue1.front();
queue1.pop_front();
n--;
//s=*s1;
cout<<s<<" -> ";
std::vector<int>::iterator it;
for(it=v[s].begin();it!=v[s].end();++it)
{

if(!c[*it])
{
//cout<<"'"<<*it<<"'";
//arrr[counter++]=*it;
queue1.push_back(*it);
c[*it]=true;
}

}
// cout<<"EK BAAR KHATAM"<<n;
// ++s1;
}
return;

}
int main()
{
vector < vector <  int >  > v;
bool c[200];
for (int i = 0; i < 200; i++)
{
c[i]=false;

}
ifstream fin;
fin.open("/home/pawan/Desktop/input1.txt");
if(!fin.is_open())
{
cout<<" file not open";
return 0;
}

int n;
fin>>n;
v.resize(n);
int i,j,w;

while(!fin.eof())
{
fin>>i>>j>>w;
v[i].push_back(j);
v[j].push_back(i);
n--;
}
for (i = 0; i < v.size(); i++)
{
std::vector<int >::iterator it;
cout<<i<<"-> ";
for(it=v[i].begin();it<v[i].end();it++)
cout<<*it<<" ";
cout<<endl;
}
BFS(1,v,c);
for(int i=0;i<counter;i++)
{
// cout<<arrr[i]<<" ";
}
}

input1.txt

15 0 2 6 1 2 5 2 3 1 1 4 6 2 7 7 4 7 4 3 6 8 4 5 12 5 8 4 8 7 2 8 11 7 11 6 4 5 9 11 9 10 8 10 11 2