int main() {
for (int i = 0; i < MAX_V; ++i)
adj[i].clear();
adj[0].push_back(std::make_pair(1, 5));
adj[0].push_back(std::make_pair(2, 1));
adj[1].push_back(std::make_pair(0, 5));
adj[1].push_back(std::make_pair(3, 1));
adj[1].push_back(std::make_pair(5, 3));
adj[1].push_back(std::make_pair(6, 3));
adj[2].push_back(std::make_pair(0, 1));
adj[2].push_back(std::make_pair(3, 2));
adj[3].push_back(std::make_pair(1, 1));
adj[3].push_back(std::make_pair(2, 2));
adj[3].push_back(std::make_pair(4, 5));
adj[3].push_back(std::make_pair(6, 3));
adj[4].push_back(std::make_pair(3, 5));
adj[5].push_back(std::make_pair(1, 3));
adj[5].push_back(std::make_pair(6, 2));
adj[6].push_back(std::make_pair(1, 3));
adj[6].push_back(std::make_pair(3, 3));
adj[6].push_back(std::make_pair(5, 2));
std::vector<int> r = dijkstra(0);
PrintVInt(r);
return 0;
}
int main() {
adj.resize(N);
adj[0].push_back(1);
adj[1].push_back(2);
adj[1].push_back(3);
adj[2].push_back(3);
std::vector<int> r = Bfs(0);
PrintVInt(r);
return 0;
}
int main() {
int T;
scanf("%d", &T);
for (int t = 0; t < T; ++t) {
std::vector<std::string> words;
scanf("%d", &N);
for (int i = 0; i < N; ++i) {
char buf[128];
scanf("%s", buf);
words.push_back(buf);
}
MakeGraph(words);
std::vector<int> r = TopologicalSort();
PrintVInt(r);
}
//
return 0;
}
