BFS Traversal using <Vector> in C++

/** Node Starts from 0 not 1.
    This program will traverse all the nodes from a starting point*/
#include<bits/stdc++.h>
using namespace std;
int main()
{
    int node;
    while(cin>>node)
    {
        int edge;
        cin>>edge;
        vector<int> Graph[node];
        int Visit[node];
        memset(Visit,-1,sizeof(Visit));
        int u,v;
        while(edge--)
        {
            cin>>u>>v;
            Graph[u].push_back(v);
            Graph[v].push_back(u);
        }
        queue<int> bi;
        int startNode;
        cin>>startNode;
        bi.push(startNode);Visit[startNode]=1;
        while(!bi.empty())
        {
            int f=bi.front();
            cout<<f<<"-->";
            bi.pop();
            for(vector<int>::iterator it=Graph[f].begin();it!=Graph[f].end();it++)
            {
                if(Visit[*it]==-1)
                {
                    Visit[*it]=1;
                    bi.push(*it);
                }
            }
        }
        cout<<"end\n";
    }
    return 0;
}

DFS Traversal using <Vector> in C++

/*************
!done
**************/
#include<bits/stdc++.h>
using namespace std;
int main()
{
    int nodes,edges;
    while(cin>>nodes>>edges){
        vector<int> Graph[nodes];
        int u,v;
        while(edges--)
        {
            cin>>u>>v;
            Graph[u].push_back(v);
            //Graph[v].push_back(u);
        }
        int Visit[nodes];
        memset(Visit,-1,sizeof(Visit));
        stack<int> st;
        int start;
        cin>>start;
        st.push(start);
        Visit[start]=1;
        while(!st.empty())
        {
            int top=st.top();
            st.pop();
            cout<<top<<"-->";
            for(vector<int>::iterator i=Graph[top].begin();i!=Graph[top].end();i++)
            {
                if(Visit[*i]==-1) {
                    st.push(*i);
                    Visit[*i]=1;
                }
            }
        }
        cout<<"-->end\n";
    }
    return 0;
}