DFS MATRIX

-

 #include <stdio.h>

#include <stdlib.h>

#define MAX 100

#define initial 1

#define visited 2


int adj[MAX][MAX];  

int state[MAX];     

int stack[MAX], top = -1; 


void create_graph(int n, int gtype);

void DF_Traversal(int n);

void DFS(int v, int n);

void push(int vertex);

int pop();

int isEmpty_stack();


int main() {

    int n, gtype;

    

    printf("Enter 1 for undirected graph and -1 for directed graph: ");

    scanf("%d", &gtype);

    printf("Enter the number of vertices: ");

    scanf("%d", &n);

    

    create_graph(n, gtype);

    

    DF_Traversal(n);

    

    return 0;

}


void create_graph(int n, int gtype) {

    int max_edges, src, dest;

    

    if (gtype == 1)

        max_edges = (n * (n - 1)) / 2;

    else if (gtype == -1)

        max_edges = n * (n - 1);


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

        printf("Enter edge %d (to quit enter -1 -1): ", i);

        scanf("%d%d", &src, &dest);


        if (src == -1 && dest == -1)

            break;


        if (src < 0 || dest < 0 || src >= n || dest >= n) {

            printf("Invalid source or destination!\n");

            i--;

        } else {

            adj[src][dest] = 1;

            if (gtype == 1)

                adj[dest][src] = 1;  

        }

    }


    printf("Adjacency Matrix is:\n");

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

        for (int j = 0; j < n; j++)

            printf("%4d", adj[i][j]);

        printf("\n");

    }

}


void DF_Traversal(int n) {

    int v;

    

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

        state[v] = initial;

    

    printf("Enter starting vertex for Depth First Search: ");

    scanf("%d", &v);

    

    DFS(v, n);

}


void DFS(int v, int n) {

    int i;

    

    push(v);

    state[v] = visited;

    

    printf("DFS Traversal starting from vertex %d:\n", v);

    printf("%d ", v);


    while (!isEmpty_stack()) {

        v = stack[top];

        

        int found = 0; 

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

            if (adj[v][i] == 1 && state[i] == initial) {

                push(i);

                state[i] = visited;

                printf("%d ", i);

                found = 1;

                break;

            }

        }


        if (!found) 

            pop();

    }

    printf("\n");

}


void push(int vertex) {

    if (top == MAX - 1) {

        printf("Stack Overflow\n");

        return;

    }

    top = top + 1;

    stack[top] = vertex;

}


int pop() {

    if (top == -1) {

        printf("Stack Underflow\n");

        exit(1);

    }

    return stack[top--];

}


int isEmpty_stack() {

    return (top == -1);

}

Comments

Post a Comment

Popular posts from this blog

AVL Trees

-
#include <stdio.h> #include <stdlib.h> // Structure to represent a node in the AVL tree struct Node {     int key;     struct Node* left;     struct Node* right;     int height; }; // Function to get the height of the node int height(struct Node* N) {     if (N == NULL)         return 0;     return N->height; } // Function to get the maximum of two integers int max(int a, int b) {     return (a > b) ? a : b; } // Helper function that allocates a new node with the given key struct Node* newNode(int key) {     struct Node* node = (struct Node*)malloc(sizeof(struct Node));     node->key = key;     node->left = NULL;     node->right = NULL;     node->height = 1; // New node is initially added at leaf     return(node); } // Right rotate subtree rooted with y struct Node* rightRotate(struct Node* y) {     ...
Read more

BFS Matrix

-
#include<stdio.h> #include<stdlib.h> #define MAX 100 #define initial 1 #define waiting 2 #define visited 3 int adj[MAX][MAX];   int state[MAX];      int queue[MAX], front = -1, rear = -1;  void create_graph(int n, int gtype); void BF_Traversal(int n); void BFS(int v, int n); void insert_queue(int vertex); int delete_queue(); int isEmpty_queue(); int main() {     int n, gtype;          printf("Enter 1 for undirected graph and -1 for directed graph: ");     scanf("%d", &gtype);     printf("Enter the number of vertices: ");     scanf("%d", &n);          create_graph(n, gtype);          BF_Traversal(n);          return 0; } void create_graph(int n, int gtype) {     int max_edges, src, dest;          if (gtype == 1)         max_edges = (n * (n - 1)) /...
Read more

BFS List

-
#include<stdio.h> #include<stdlib.h> #define MAX 100 #define initial 1 #define waiting 2 #define visited 3 struct Node { int vertex; struct Node* next; }; int queue[MAX],front=-1,rear=-1; int state[MAX]; struct Node* adj[MAX]; void create_graph(int n,int gtype); void insert_queue(int v); int delete_queue(); int isEmpty_queue(); void BFT(int n); void BFS(int start,int n); void add_edge(int src,int dest); struct Node* create_node(int v); int main() { int gtype,n; printf("Enter 1 for undirected graph and -1 for directed graph:"); scanf("%d",&gtype); printf("Enter the number of vertices:"); scanf("%d",&n); create_graph(n,gtype); BFT(n); return 0; } void create_graph(int n,int gtype) { int max_edges,src,dest; if(gtype==1) max_edges=(n*(n-1))/2; else if(gtype==-1) max_edges=(n*(n-1)); for(int i=0;i<n;i++) adj[i]=NULL; for(int i=0;i<max_edges;i++) { printf("Enter edge %d (press -1 and -1 to quit):...
Read more