Working with graph$\_$am$\_$neighbours: $/**$

$*$ Returns an array of all vertices connected to a vertex.

$*$ vertices must be defined with a size of source$->$size.

$*$

$*$ @param source $-$ pointer to a graph

$*$ @param vertex $-$ index of a vertex

$*$ @param vertices $-$ array of neighbours

$*$ @param count $-$ number of vertices

$*/$

and graph$\_$am$\_$depth$\_$traversal: $/**$

$*$ Performs a depth$-$first traversal of a graph.

$*$

$*$ @param source $-$ pointer to a graph

$*$ @param vertex $-$ index of a vertex to start traversal from

$*$ @param vertices $-$ array of resulting vertices

$*$ @param count $-$ number of items in vertices

$*/$

I am getting stuck on the depth$-$first traversal and what to do after that when finding the neighbouring vertexes $```$

$\backslash$Theta$/**$

$*$ Stores row$/......$ pairs of adjacency matrix values.

$*/$

$-$ typedef struct $\{$

int row;

int col;

$\}$ graph$\_$am$\_$pair;

e$/**$

$*$ Adjacency Matrix Graph header.

$*/$

$-$ typedef struct $\{$

int size; $//$ size $($width$/$height$)$ of adjacency matrix

int $*$values; $//$ pointer to $2$D array of values

$\}$ graph$\_$am;

$```$