Implement the DFS Traversals on Graphs.

#include<stdio.h>

#define size 10

int s[10],visited[10],a[10][10],top=-1,n,v,w,st;

void dfs(int st);

void push(int);

int  pop();

int instack(int);

int main()

{

    int i,j;

    printf("\nEnter no of Vertices:");

    scanf("%d",&n);

    printf("\nEnter Adjacent Matrix From Given Graph:");

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

    {

for(j=1;j<=n;j++)

{

   scanf("%d",&a[i][j]);

   visited[i]=0;

}

    }

 printf("\nEnter Starting Vertex:");

 scanf("%d",&st);

 printf("\nDFS Travasal of Given Graph");

 dfs(st);

 return 0;

}

void dfs(int st)

{

   push(st);

   while(top!=-1)

   {

       v=pop();

       if(visited[v]==0)

       {

   visited[v]=1;

   printf("->%d",v);

   for(w=1;w<=n;w++)

   {

       if(a[v][w]==1)

       {

   if(visited[w]==0 && instack(w)==0)

    push(w);

       }

   }

       }

   }

}

void push(int x)

{

     if(top==size-1)

    printf("\nOverflow");

     else

     {

top=top+1;

s[top]=x;

     }

}

int pop()

{

     int item;

     if(top==-1)

    return -1;

     else

      {

   item=s[top];

   top=top-1;

   return item;

      }

}

int instack(int w)

{

   int j;

   for(j=top;j==0;j--)

   {

      if(s[j]==w)

   return 1;

   }

   return 0;

}

Comments

Post a Comment

Popular posts from this blog

Create a Binary Search Tree of integers and perform the following operations (i)insert (ii) delete (iii). Search (iv) traversals (pre-order, in-order, post-order) BST

#include<stdio.h> struct node { int data; struct node *lchild,*rchild; }*root,*ptr,*parent,*new,*ptr1,*x,*y,*p; void insert(int); void delete(int); void search(int); void inorder(struct node *); void preorder(struct node *); void postorder(struct node *); struct node* insucc(struct node *); int main() { int ch,item,key; root=NULL; while(1) { printf("\nEnter Your Choice\n1.Insert\n2.Delete\n3.Search\n4.Inorder\n5.Preorder\n6.Postorder\n7.Exit"); scanf("%d",&ch); switch(ch) { case 1:printf("Enter item:");        scanf("%d",&item);        insert(item);        break; case 2:printf("Enter item:"); scanf("%d",item); delete(item); break; case 3: printf("Enter Key To Search:"); scanf("%d",&key); search(key); break; case 4:inorder(root); break; case 5:preorder(root); break; case 6:postorder(root); break; default:e...
Read more

Creation Of DLL

 #include<stdio.h> struct node { int data; struct node *llink,*rlink; }*header, *new ,*ptr; void create(); void traverse(); int main() { int ch; clrscr(); header->rlink=NULL; while(1) { printf("\n Enter your Choice\n 1.Create\n 2.Traverse\n 3.Exit\n"); scanf("%d",&ch); switch (ch) { case 1: create(); break; case 2:traverse(); break; default:exit(0); }    } return 0; } void create() { int x; new=(struct node *)malloc(sizeof(struct node)); if (new==NULL) { printf("\n No Space"); exit(0); } printf("\n Enter data to insert:"); scanf("%d",&x); new->data=x; ptr=header->rlink; new->llink=header; header->rlink=new; new->rlink=ptr; if(ptr!=NULL) ptr->llink=new; } void traverse() {     if (header->rlink==NULL)     { printf("\n Link is Empty"); exit(0);      }     else     { printf("\n Data Parts Of Linked List...
Read more

Develop non-recursive functions to perform search for a Key value in a given list using (i) Binary Search Non Recursive

#include<stdio.h> int binary_search(int a[],int low,int high,int key); int main() { int a[10],i,n,key,found; clrscr(); printf("enter no of elements"); scanf("%d",&n); printf("enter %d elements",n); for(i=0;i<n;i++) scanf("%d",&a[i]); printf("enter key element"); scanf("%d",&key); found=binary_search(a,0,n-1,key); if(found==-1) printf("\n unsuccessful search key %d is not found in the list",key); else printf("\n successful search key %d is found at index %d",key,found); return 0; } int binary_search(int a[],int low,int high,int key) { int mid; while(low<=high) { mid=(low+high)/2; if(key==a[mid]) return mid; else if(key<a[mid]) high=mid-1; else low=mid+1; } return -1; }
Read more