15-11-2012, 04:31 PM
IMPLEMENTATION OF TOPOLOGICAL SORT
IMPLEMENTATION OF TOPOLOGICAL SORT.docx (Size: 14.21 KB / Downloads: 28)
Coding:
#include<stdio.h>
#define max 20
int n,adj[max][max];
int front=-1,rear=-1,queue[max];
void main()
{
int i,j=0,k;
int topsort[max],indeg[max];
clrscr();
create_graph();
printf("\nThe Adjacency Matrix is ::\n");
display();
for(i=1;i<=n;i++)
{
indeg[i]=indegree(i);
if(indeg[i]==0)
insert_queue(i);
}
while(front<=rear)
{
k=delete_queue();
topsort[j++]=k;
for(i=1;i<=n;i++)
{
if(adj[k][i]==1)
{
adj[k][i]=0;
indeg[i]=indeg[i]-1;
if(indeg[i]==0);
insert_queue(i);