Experiment Number: 6
Student Name: Tushar Shourie UID: 20BCS3664
Branch: Information Security Section & Group: 20BIS-2/A
Semester: 5th Date: 13-10-2022
Course Name: ADVANCED
PROGRAMMING LAB
Course Code: 20CSB-334
1.Aim/Overview of the practical :
Obtain the Topological ordering of vertices in a given digraph.
2.Task to be done : To obtain the topological ordering of vertices in a given
disgraph.
3. Algorithm:
•Start.
•Initialize a stack to store the nodes.
•The visited nodes will be stored in an array.
•The unvisited nodes will call the recursive function.
•The topological sort function on the node will be called recursively.
•Then, print the stack.
•Stop.
4. Program Code:
#include <bits/stdc++.h>
using namespace std;
class Graph {
int V;
list<int>* adj;
void topologicalSortUtil(int v, bool visited[],
stack<int>& Stack);
public:
Graph(int V);
void addEdge(int v, int w);
void topologicalSort();
};
Graph::Graph(int V)
