topological sort scheme code example
Example: topological sort
void dfs_helper(T src, map<int,bool>& visited, list<T> &ordering) {
visited[src] = true;
for(T nbr:l[src]) {
if(!visited[nbr]) {
dfs_helper(src,visited,ordering);
}
}
ordering.push_front(src);
}
int dfs(T src) {
map<int,bool> visited;
list<T> ordering;
for(auto p:l) {
T node = p.first;
visited[node] = false;
}
for(auto p:l) {
T node = p.first;
if(!visited[node]) {
dfs_helper(node,visited,ordering);
}
}
for(auto node:ordering) {
cout << node << endl;
}
}