void topologicalSort()
{
stack<int> Stack;
bool *visited = new bool[V];
for (int i = 0; i < V; i++)
visited[i] = false;
for ( int i = 0 ; i < V ; i++ )
{
if ( visited[i] == false)
{
topologicalSortUtil(i, visited, Stack);
}
}
while ( !Stack.empty() ) {
cout << Stack.top() << " ";
Stack.pop();
}
}
void topologicalSortUtil(int v, bool visited[] , stack<int> &Stack)
{
visited[v] = true;
for (auto i = adj[v].begin() ; i != adj[v].end() ; ++i )
{
if ( !visited[*i] )
{
topologicalSortUtil(*i, visited, Stack);
}
}
Stack.push(v);
}
// A recursive function used by topologicalSort
void Graph::topologicalSortUtil(int v, bool visited[],
stack<int> &Stack)
{
// Mark the current node as visited.
visited[v] = true;
// Recur for all the vertices adjacent to this vertex
list<int>::iterator i;
for (i = adj[v].begin(); i != adj[v].end(); ++i)
if (!visited[*i])
topologicalSortUtil(*i, visited, Stack);
// Push current vertex to stack which stores result
Stack.push(v);
}
// The function to do Topological Sort. It uses recursive
// topologicalSortUtil()
void Graph::topologicalSort()
{
stack<int> Stack;
// Mark all the vertices as not visited
bool *visited = new bool[V];
for (int i = 0; i < V; i++)
visited[i] = false;
// Call the recursive helper function to store Topological
// Sort starting from all vertices one by one
for (int i = 0; i < V; i++)
if (visited[i] == false)
topologicalSortUtil(i, visited, Stack);
// Print contents of stack
while (Stack.empty() == false)
{
cout << Stack.top() << " ";
Stack.pop();
}
}
