Finding cycles in a graph
Find the shortest path from every vertex to every other vertex. To find the shortest cycle from $s$ to $v$, just concatenate the shortest path from $s$ to $v$ and then $v$ to $s$ which was found earlier