let G $=$ be a simple graph of order n $=|$V$|,$ and consider the following algorithm

for k $=1$ to $?$

for each x$,$ y$,$ z in V

if $($x$,$z$)$ in E and $($z$,$ y$)$ in E and x$!=$y then E$<-$E$+($x$,$y$)$

what does this algorithm compute? be specific and concise. Hint: try it on small example