Euler path

#include iostream
using namespace std;
int graph[12][12];
int visited[12][12],n;
void traverse(int node);
int main(){
freopen("sam.txt","r",stdin);
int i,j,flag=0;
cin>>n;
int count=0;
for(i=0;i>graph[i][j];
count+=graph[i][j];
}

if(count%2){flag=1;break;}

}
if(flag){cout<<"\n No euler path is there\n";}
else traverse(0);
return 0;

}
void traverse(int node){
int i;
for(i=0;i