Logo 
Search:

C++ Programming Articles

Submit Article
Home » Articles » C++ Programming » Data File StructureRSS Feeds

Program that sorts numbers using topological sort method

Posted By: Easy Tutor     Category: C++ Programming     Views: 13246

Write a program that sorts numbers using topological sort method.

Code for Program that sorts numbers using topological sort method in C++ Programming

#include <iostream.h>
#include <conio.h>
#define MAX_NODE 50

struct node{
    int vertex;
    node *next;
};

node *adj[MAX_NODE]; //For storing Adjacency list of nodes.int totNodes; //No. of Nodes in Graph.constint ready=1,wait=2,processed=3; //status of node.int status[MAX_NODE];//status arr for maintaing status.
node *sngllist=NULL; //Singly Link Listvoid createGraph(){
    node *newl,*last;
    int neighbours,neighbour_value;
    cout<<"\n\n---Graph Creation---\n\n";
    cout<<"Enter total nodes in graph : ";
    cin>>totNodes;
    for(int i=1;i<=totNodes;i++){
        last=NULL;
        cout<<"\nEnter no. of nodes in the adjacency list of node "<<i<<"\n";
        cout<<"--> That is Total Neighbours of "<<i<<" : ";
        cin>>neighbours;
        for(int j=1;j<=neighbours;j++){
            cout<<"Enter neighbour #"<<j<<" : ";
            cin>>neighbour_value;
            newl=new node;
            newl->vertex=neighbour_value;
            newl->next=NULL;
            if(adj[i]==NULL)
                adj[i]=last=newl;
            else{
                last->next = newl;
                last = newl;
            }
        }
    }
}


void dfsVisit(int i)
{
    node *tmp,*newl;
    int v;

    tmp=adj[i];
    while(tmp != NULL)
    {
        v=tmp->vertex;
        if(status[v]==ready)
            dfsVisit(v);
        tmp=tmp->next;
    }

    newl=new node;
    newl->vertex=i;
    newl->next=sngllist;
    sngllist=newl;
    status[i]=processed;
}



void topologicalSort(){
    int i;

    for(i=1;i<=totNodes;i++)
        status[i]=ready;

    for(i=1;i<=totNodes;i++){
        if(status[i]==ready)
            dfsVisit(i);
    }

    //print listwhile(sngllist!=NULL){
        cout<<"   "<<sngllist->vertex;
        sngllist=sngllist->next;
    }

}


void main(){
    clrscr();
    cout<<"*****Topological Sort*****\n";
    createGraph();
    cout<<"\n===Topological Sort is as under===\n";
    topologicalSort();
    getch();
}
  
Share: 


Didn't find what you were looking for? Find more on Program that sorts numbers using topological sort method Or get search suggestion and latest updates.

Easy Tutor
Easy Tutor author of Program that sorts numbers using topological sort method is from United States. Easy Tutor says

Hello Friends,

I am Free Lance Tutor, who helped student in completing their homework.

I have 4 Years of hands on experience on helping student in completing their homework. I also guide them in doing their final year projects.

I have share many programs on this website for everyone to use freely, if you need further assistance, than please contact me on easytutor.2ya [at the rate] gmail [dot] com

I have special discount scheme for providing tutor services. I am providing tutor service to students from various contries, currently most of my students are from United States, India, Australia, Pakistan, Germany, UK and Canada.

I am also here to expand my technical network to receive more opportunity in my career, make friends to help them in resolving their technical problem, learn and share my knowledge, If you like to be my friend, Please send me friend request.

Thanks,
Happy Programming :)

 
View All Articles

 

Other Interesting Articles in C++ Programming:


 
Please enter your Comment

  • Comment should be atleast 30 Characters.
  • Please put code inside [Code] your code [/Code].

 
No Comment Found, Be the First to post comment!