Scribd
Upload
48 views4 pages

Program 9 WAP To Implement Topological Sorting in Graphs Code

This program implements topological sorting on graphs. It takes a graph as input from the user, calculates the indegree of each vertex, and inserts vertices with 0 indegree into a queue. It then repeatedly removes vertices from the queue and inserts their neighbors. The order of vertices removed from the queue provides the topological sort. It checks for cycles by ensuring all vertices are removed from the queue.

Uploaded by

Dhruv Sachdeva
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
48 views4 pages

Program 9 WAP To Implement Topological Sorting in Graphs Code

This program implements topological sorting on graphs. It takes a graph as input from the user, calculates the indegree of each vertex, and inserts vertices with 0 indegree into a queue. It then repeatedly removes vertices from the queue and inserts their neighbors. The order of vertices removed from the queue provides the topological sort. It checks for cycles by ensuring all vertices are removed from the queue.

Uploaded by

Dhruv Sachdeva
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Program 9

WAP to implement topological sorting in graphs

Code:
#include <stdio.h>
#include <stdlib.h>

#define MAX 100

int n;
int adj[MAX][MAX];
void create_graph();
int queue[MAX], front = -1, rear = -1;
void insert_queue(int v);
int delete_queue();
int isEmpty_queue();

int indegree(int v);

int main()
{
int i, v, count, topo_order[MAX], indeg[MAX];

create_graph();

for (i = 0; i < n; i++)


{
indeg[i] = indegree(i);
if (indeg[i] == 0)
insert_queue(i);
}

count = 0;

while (!isEmpty_queue() && count < n)


{
v = delete_queue();
topo_order[++count] = v;
for (i = 0; i < n; i++)
{
if (adj[v][i] == 1)
{
adj[v][i] = 0;
indeg[i] = indeg[i] - 1;
if (indeg[i] == 0)
insert_queue(i);
}
}
}

if (count < n)
{
printf("\nNo topological ordering possible, graph contains cycle\n");
exit(1);
}
printf("\nVertices in topological order are :\n");
for (i = 1; i <= count; i++)
printf("%d ", topo_order[i]);
printf("\n");

return 0;
}

void insert_queue(int vertex)


{
if (rear == MAX - 1)
printf("\nQueue Overflow\n");
else
{
if (front == -1)
front = 0;
rear = rear + 1;
queue[rear] = vertex;
}
}

int isEmpty_queue()
{
if (front == -1 || front > rear)
return 1;
else
return 0;
}

int delete_queue()
{
int del_item;
if (front == -1 || front > rear)
{
printf("\nQueue Underflow\n");
exit(1);
}
else
{
del_item = queue[front];
front = front + 1;
return del_item;
}
}

int indegree(int v)
{
int i, in_deg = 0;
for (i = 0; i < n; i++)
if (adj[i][v] == 1)
in_deg++;
return in_deg;
}

void create_graph()
{
int i, max_edges, origin, destin;

printf("\nEnter number of vertices : ");


scanf("%d", &n);
max_edges = n * (n - 1);

for (i = 1; i <= max_edges; i++)


{
printf("\nEnter edge %d(-1 -1 to quit): ", i);
scanf("%d %d", &origin, &destin);

if ((origin == -1) && (destin == -1))


break;

if (origin >= n || destin >= n || origin < 0 || destin < 0)


{
printf("\nInvalid edge!\n");
i--;
}
else
adj[origin][destin] = 1;
}
}

Output:
Dhruv sachdeva

You might also like