C++ Programming Tutorial

 
 
 

Data File Structure Programs

Array

Insert, edit, delete, append, display, Srch. Insert, delete, merge, delete multiple occurrences Arrays as a Stack in graphics

Stack

Stack operations using array Stack using static memory allocation Stack using dynamic memory allocation Double ended link list as a stack Lnked list as a Stack Infix expr. to Postfix expr. Postfix expr. into an Infix expr. Arrays as a Stack in graphics Stack as an Arithmetic expr. Evaluater Graphical Rep. of Stack Stack to traverse - inodr, postodr, preodr

Queue

Queue using static memory allocation Queue using dynamic memory allocation Circular queue Linked list as a Queue Double Ended linked list as a Queue Graphical Rep. of Queue Arrays as a Linear Queue Array as a Circular Queue Arrays as a Linear Queue ( in graphics ) Arrays as a Circular Queue ( in graphics )

Linked List

Singly link list Circular linked list Doubly link list Linked list as a Queue Linked list as a Stack Double Ended linked list as a Queue Double Ended linked list as a Stack Infix to Postfix - Linked List as Stack Circular doubly link list Single Ended Linked List - Sorting in both odr Hashing - double ended Linked List Sort of link list

Tree

Linked List as a Binary Srch. Tree Set Class using Binary Srch. Tree Maximum depth of Binary Srch. Tree Minimum Spaning Tree Prims algo - minimum spanning tree Traverse binary tree - inodr, preodr, post Find number in binary Srch. tree display levell

Sorting

Bubble Sort Selection Sort Insertion Sort Radix Sort Merge Sort Quick Sort Heap Sort Linear Sort Shell Sort Topological Sort

Searching

Linear Srch. or Sequential Srch. Binary Search Breadth First Search Traversal Depth First Search Traversal Shortest Path-Given Source-Destination-Dijkstras

Hashing

Simple implementation of Hashing Hashing using double-ended Linked List Hashing using Mid-Square Method Example of Hashing n term of the fibonacci series using recursion

Recursion

Factorial of the given number using recursion Mystery of Towers of Hanoi using recursion
 
 

Image

#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.

////////////Stack Operation\\\\\\\\\\\\\\\\\\\\\\\\    int top=-1;
int stack[MAX_NODE];

void push(int item){
     top=top+1;
     stack[top]=item;
}

int pop(){
     int deldata=stack[top];
     top=top-1;
     return(deldata);
}

int is_stk_empty(){
     if(top==-1)
     return(1);
     else
     return(0);
}
////////////Stack Operation\\\\\\\\\\\\\\\\\\\\\\\\    
void 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 DFS_traversal(){
    node *tmp;
    int N,v,start_node,status[MAX_NODE];//status arr for maintaing status.
    const int ready=1,wait=2,processed=3; //status of node.

    cout<<\"Enter starting node : \";
    cin>>start_node;

    //step 1 : Initialize all nodes to ready state.
    for(int i=1;i<=totNodes;i++)
        status[i]=ready;

    //step 2 : push the start node in stack and change status.
    push(start_node); //Push starting node into stack.
    status[start_node]=wait; //change it status to wait state.

    //step 3 : Repeat until stack is empty.
    while(is_stk_empty()!=1){

        //step 4 : pop the node N of stack.
        //process N and change the status of N to
        //be processed state.
        N = pop(); //pop the node from stack.
        status[N]=processed; //status of N to processed.
        cout<<\"   \"<<N; //displaying processed node.

        //step 5 : push onto stack all the neighbours of N,
        //that are in ready state and change their status to
        //wait state.
        tmp = adj[N];  //for status updation.
        while(tmp!=NULL){
            v = tmp->vertex;
            if(status[v]==ready){//check status of N\'s neighbour.
                push(v); //push N\'s neighbour who are in ready state.
                status[v]=wait; //and make their status to wait state.
            }
            tmp=tmp->next;
        }
    }
}

void main(){
    clrscr();
    cout<<\"*****Depth First Search Traversal*****\\n\";
    createGraph();
    cout<<\"\\n===DFS traversal is as under===\\n\";
    DFS_traversal();
    getch();
}

    Related Post:
  1. Program to find the value of sin at any given angle

  2. Program that provides an example of binary files

  3. Program to display bill receipt based on customer information and create telephone directory

  4. Program that displays the size, address of the variables of type int , float and char.

  5. Program that reads 10 students marks and displays average, lowest and highest marks

  6. PROGRAM OF BASIC TO CLASS CONVERSION

  7. Program to show the implementation of Cohen-Sutherland Line Clipping Algorithm

  8. Program using cout statement to display in single line

  9. Program to convert an Infix Expression into a Postfix Expression using Linked List as a Stack

  10. Program to convert an Infix Expression into a Postfix Expression using Linked List as a Stack

  11. Program that computes the n_th term of the fibonacci series using recursion

  12. Simple Inventory Program

  13. Program to get possible prime numbers like number 6158 contains the substrings 6, 1, 5, 8, 61, 15, 58, 615, 158, and 6158.Find the largest substring..

  14. Program to illustrate the use of nested structures

  15. Program that list of letters should be an alphabetical list of upper case letters followed by an alphabetical list of lower case letters

  16. Program of LL parser1

  17. CREATING A CLASS ACCOUNTS FROM WHICH ARE DERIVED TWO CLASSES CURRENT AND SAVINGS AND THEN ASK THE USER FOR THE TYPE OF ACCOUNT HE WANTS TO CREATE

  18. Matrix program to display matrix

  19. Program to print table of values of the function y = e raise to -x

  20. Program to illustrate the implementation of Arithmetic Expression Evaluater accepting {} & [] also

 
 
Didn't find what you were looking for? Find more on Program of Deapth First Search Traversal ( DFS )