adjancy_matrix_dfs.cpp

#include<bits/stdc++.h>
using namespace std;
int m[100][100]={0};
int visited[10]={0};
int v;
void addedge(int v1,int v2 ,bool flag=true)
{
    m[v1][v2]=1;
    if(flag)
    m[v2][v1]=1;
}
void dfs(int source)
{
    cout<<source<<" ";
    visited[source]=1;
    for(int i=0;i<=v;i++)
    {
        if(m[source][i]==1 && visited[i]==0)
         dfs(i);
    }
}
int main()
{
    bool flag;
    int e,v1,v2;
    cout<<"Enter the type of graph 0 : directed  1 : undirected";
    cin>>flag;
    cout<<"Enter the no of vertices::";
    cin>>v;
    cout<<"Enter the no of edges::";
    cin>>e;
    cout<<"Enter the pair of edges::";
    for(int i=0;i<e;i++)
    {
        cin>>v1>>v2;
        addedge(v1,v2,flag);
    }
    for(int i=0;i<=v;i++)
    {
        for(int j=0;j<=v;j++)
        {
            cout<<m[i][j]<<" ";
        }
        cout<<"\n";
    }
    cout<<"\n";
    dfs(1);
    return 0;
}