I need to solve Travelling Salesman problem using Recursive Depth First Search.I started with reading the text file in 2D array for distances and 1 D array for the cities.Now I need follow the following pseudo code.What I am really confused with is what form of data structure is accepted by the DFS()below.Do I need to get a tree notation first like some link list.

void Depth_first_search(tour_t tour)
{
city_t city;

if (City_count(tour) == n)
{
if (Best_tour(tour))
Update_best_tour(tour);
}
else
{
for each neighboring city
if (Feasible(tour, city))
{
Add_city(tour, city);
Depth_first_search(tour);
Remove_last_city(tour);
}
}
}
Desperately need some relevant help.Thank You