#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> longest_trip(int n, int d) {
int front = 0, back = -1;
for (int v = 1; v < n; v++) {
if (are_connected(vector<int>(1, front), vector<int>(1, v))) {
back = v;
break;
}
}
assert(back != -1);
vector<int> trip;
trip.push_back(front);
trip.push_back(back);
for (int v = 0; v < n; v++) {
if (v != back && v != front) {
if (are_connected(vector<int>(1, trip.back()), vector<int>(1, v))) {
trip.push_back(v);
} else {
vector<int> now = trip;
trip.clear();
trip.push_back(v);
for (int u : now) {
trip.push_back(u);
}
}
}
}
return trip;
}
