C++ Programming Tutorial


Data File Structure Programs


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


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


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


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


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


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


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


#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){

int pop(){
     int deldata=stack[top];

int is_stk_empty(){
////////////Stack Operation\\\\\\\\\\\\\\\\\\\\\\\\    
void createGraph(){
    node *newl,*last;
    int neighbours,neighbour_value;
    cout<<\"\\n\\n---Graph Creation---\\n\\n\";
    cout<<\"Enter total nodes in graph : \";
    for(int i=1;i<=totNodes;i++){
        cout<<\"\\nEnter no. of nodes in the adjacency list of node \"<<i<<\"\\n\";
        cout<<\"--> That is Total Neighbours of \"<<i<<\" : \";
        for(int j=1;j<=neighbours;j++){
            cout<<\"Enter neighbour #\"<<j<<\" : \";
            newl=new node;
                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 : \";

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

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

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

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

    Related Post:
  1. Program to write macro that obtains the largest of three numbers

  2. Program to find the value of sin at any given angle

  3. Program to illusrate comparision operator overloading

  4. Program to show the 3D Reflection Transformation along yz-plane

  5. Program of text box

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

  7. Program of maintaining banking account information system using inheritance

  8. Program to fill a Circle using Scan-Line Circle Fill Algorithm using Polar Coordinates

  9. Perform insert, delete, merge and delete multiple occurrences of a number from an array

  10. Program to draw a line using Bresenhams Line Algorithm (BLA) for lines with slopes negative and less than 1

  11. Program that reads marks obtained by a student in a test of 100 marks and computes his grade

  12. Program to perform linear sort

  13. Program to show the implementation of Cohen-Sutherland MidPoint Subdivision Line Clipping Algorithm

  14. Nested Structure Database Program

  15. Program to compute and print out the decimal notation for the reciprocal of each input integer

  16. Program to computes the product of two matrices of size 4x4 using Divide and Conquer Strategy

  17. Program to illustrate the implementation of Translation Transformation

  18. Program to coumputes and displays the factorial of the given number ( using Recursive Algorithm )

  19. Program that provides an example of passing objects to function using call by reference method

  20. Program to illustrate the difference between the use of strcomp, strcmpi and stricmp

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