Scribd Logo
Upload

Welcome to Scribd!

  • Write C

    Uploaded by

    prasanthihrd
    6 views2 pages
    This C++ program implements depth-first search (DFS) on a graph. It takes the number of vertices and edges as input, builds the adjacency matrix, and performs DFS traversal starting from an initial vertex. It outputs the order in which vertices are visited during the DFS traversal.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C++ program implements depth-first search (DFS) on a graph. It takes the number of vertices and edges as input, builds the adjacency matrix, and performs DFS traversal starting from an initial vertex. It outputs the order in which vertices are visited during the DFS traversal.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views2 pages

    Write C

    Uploaded by

    prasanthihrd
    This C++ program implements depth-first search (DFS) on a graph. It takes the number of vertices and edges as input, builds the adjacency matrix, and performs DFS traversal starting from an initial vertex. It outputs the order in which vertices are visited during the DFS traversal.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    /* Write C++ programs for the implementation of Depth-first search(DFS) for a given graph */

    #include<iostream> #include<conio.h> #include<stdlib.h> int cost[10][10],i,j,k,n,stk[10],top,v,visit[10],visited[10]; main() { int m; cout <<"enterno of vertices"; cin >> n; cout <<"ente no of edges"; cin >> m; cout <<"\nEDGES \n"; for(k=1;k<=m;k++) { cin >>i>>j; cost[i][j]=1; } cout <<"enter initial vertex"; cin >>v; cout <<"ORDER OF VISITED VERTICES"; cout << v <<" "; visited[v]=1; k=1; while(k<n) { for(j=n;j>=1;j--) if(cost[v][j]!=0 && visited[j]!=1 && visit[j]!=1) { visit[j]=1; stk[top]=j; top++; } v=stk[--top]; cout<<v << " "; k++; visit[v]=0; visited[v]=1; } }

    OUTPUT enterno of vertices9 ente no of edges9 EDGES 12 23 26 15 14 47 57 78 89 enter initial vertex1 ORDER OF VISITED VERTICES1 2 3 6 4 7 8 9 5

    You might also like