Topological Sorting

Topological Sorting

/********************************************************************

-> This C++ Program is to implement Topological sorting.

-> This program sorts the given integers in increasing order
using topological sorting

-> unwaighted digraph is used to sort the numbers

-> Data Structers:
Graph:Adjacency List

-> This program works in microsoft vc++ 6.0 environment.

*********************************************************************/

#include
class graph
{
private:
int n;
int data[20];
int gptr[20][20];
public:
void create();
void topological();
};
void graph::create()
{
cout<<”**********************************************************\n”
<<”This program sorts the given numbers in increasing order\n”
<<”\t\t using topological sorting\n”
<<”***********************************************************\n”;
cout<<”Enter the no. of nodes in the directed unweighted graph ::”;
cin>>n;
for(int i=1;i<=n;i++)
{
cout<<”enter data for the node “<cin>>data[i];
}

cout<<”enter the adjacency matrix for the graph ::\n”;
cout<<”( type 1 for graph[i][j] if there is an edge from i to j”
<<”else type 0 )\n\n”;

int j;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
cin>>gptr[i][j];
}
void graph::topological()
{
int flag;
int i,j;
int poset[20],included[20];
for(i=1;i<=n;i++)
{
poset[i]=0;
included[i]=false;
}
int k=1;
flag=true;
int zeroindegree;
int c=1;
while(flag==1)
{
for(i=1;i<=n;i++)
{
if(!included[i])
{
zeroindegree=true;
for(j=1;j<=n;j++)
{
if(gptr[j][i]>0)
{
zeroindegree=false;
break;
}
}

if(zeroindegree)
{
included[i]=true;
poset[k]=data[i];
k=k+1;
for(j=1;j<=n;j++)
{
gptr[i][j]=-1;
gptr[j][i]=-1;
}
break;
}
}
}
if(i==n+1)
{
if(zeroindegree==false)
{
cout<<”Graph is not acyclic\n”;
return;
}
else
{
poset[k]=data[i-1];
k=k+1;
flag=false;
}
}
}
cout<<”After topological sorting the numbers are :\n”;
for(i=1;i<=n;i++)
cout<

cout<}
int main()
{
graph obj;
obj.create();
obj.topological();
return 0;
}