#include <bits/stdc++.h>
#include "worldmap.h"
using namespace std;
vector<int> adj[101];
vector<int> vect;
bool vis[101];
void dfs(int x, int p) {
vis[x]=1;
vect.push_back(x);
for (int y : adj[x]) {
if(vis[y])continue;
dfs(y, x);
vect.push_back(x);
}
}
std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {
for(int i=0;i<=N;i++)vis[i]=0;
if(M + M == N * (N - 1)) {
int h=240;
vector< vector< int> > v(h, vector<int> (h));
srand(time(0));
for(int i=0;i<h;i++){
for(int j=0;j<h;j++){
v[i][j]= rand()%N+1;
}
}
return v;
}
for (int i = 0; i < 42; i++) {
adj[i].clear();
}
vect.clear();
for (int i = 0; i < M; i++) {
adj[A[i]].push_back(B[i]);
adj[B[i]].push_back(A[i]);
}
dfs(1, 0);
int sz = vect.size();
std::vector<std::vector<int>> ans(sz, std::vector<int>(sz, 1));
for (int i = 0; i < sz; i++) {
for (int j = 0; j < sz; j++) {
ans[i][j] = vect[j];
}
}
return ans;
}
