HELP toplogical sort

[beginnner]

please help i must add topological sort this code but i can't.please help

  

#include <iostream>
#include <queue>
#include <string>
using namespace std;

class City
{
	private:
	int id;
	string name;

	public:
	City(int id, string name)
	{
		this->id = id;
		this->name = name;
	}
	int getId()
	{
		return id;
	}

	string getName()
	{
		return name;
	}
};


int main()
{
	City *cities[10];
	cities[0] = new City(1, "Adana");
	cities[1] = new City(6, "Ankara");
	cities[2] = new City(7, "Antalya");
	cities[3] = new City(10, "Balikesir");
	cities[4] = new City(16, "Bursa");
	cities[5] = new City(26, "Eskisehir");
	cities[6] = new City(34, "Istanbul");
	cities[7] = new City(35, "Izmir");
	cities[8] = new City(45, "Manisa");
	cities[9] = new City(61, "Trabzon");

	queue<City *> city[10];
	city[1].push(cities[2]);
	city[2].push(cities[0]);
	city[2].push(cities[9]);
	city[3].push(cities[6]);
	city[4].push(cities[6]);
	city[4].push(cities[2]);
	city[4].push(cities[5]);
	city[5].push(cities[1]);
	city[5].push(cities[0]);
	city[6].push(cities[5]);
	city[6].push(cities[9]);
	city[6].push(cities[1]);
	city[7].push(cities[3]);
	city[7].push(cities[4]);
	city[8].push(cities[5]);
	city[9].push(cities[1]);

	for(int i=0; i<10; i++)
	{
		while(!city[i].empty())
		{
			cout<<city[i].front()->getId()<<" ";
			city[i].pop();
		}
		cout<<endl;
	}


	return 0;
}

[giblit]

you never even put any values for city[0] if you only want 9 then do 0-8 not 1-9 other than that I don't seem to understand your problem

[beginnner]

city 0 not going anywhere,,,i must listed road city to city,,,if i add toplogical sort part,,i continue to code,,please help