#include

#include

#include

#include

using namespace std;

vector$>$ graph;

$//$ Function to perform BFS and calculate max hops

int maxHopsBFS$($int startNode$)\{$

$//$ 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$]$;

$\}$

$\}$

$$ cout $$ maxHopsBFS$($startVertex$)$ endl;

$$ return $0$;

$\}$

Please fill out in C$++$