public void topologicalSort()
	{
		while(list.size() != 0){
			int t = list.pollFirst();
			ts.add(t);

			for(int i = 0; i < len; i++)
			{
				int value = graph[t][i];
				if(value == 1){
					graph[t][i] = 0;
					
					int sum = 0;
					for(int j = 0; j < len; j++)
						sum += graph[j][i];

					if(sum == 0)
						list.add(i);
				}
			}
		}
		System.out.println(ts);
	}