#include

#include

using namespace std;

vector$>$ graph;

vector visited;

$//$ Function to perform DFS traversal $-$ flag is useful to

void dfs$($int vertex, bool flag$)\{$

$//$ WRITE YOUR CODE HERE

$\}$

int main$()\{$

$//$ Input the number of vertices & start vertex for DFS

$$ int n$,$ startVertex;

$$ cin $>>$ n $>>$ startVertex;

$//$ Input the adjacency matrix

$$ graph $=$ vector$>($n$,$ vector$($n$))$;

$$ for $($int i $=0$; i $$ n; i$++)\{$

$$ for $($int j $=0$; j $$ n; j$++)\{$

$$ cin $>>$ graph$[$i$][$j$]$;

$\}$

$\}$

$$ visited $=$ vector $($n$,$ false$)$;

$//$ Perform DFS traversal $-$ start with false for the starting node,

$//$to see whether it will become true through back edge

$$ dfs$($startVertex$,$ false$)$;

$$ cout $$ "Yes!";

$//$cout visited$[$startVertex$]?$ "Yes!" : $"$No$!")$;

$$ return $0$;

$\}$

Please fill out code in C$++.$