We wish to find shortest cycle (if any cycle exists) that includes a special vertex $v$.
We know if we run DFS on an undirected graph, back edges show us that there exists at least one cycle.
This answer on SO explains why neither BFS or DFS work. However, I still think that DFS could be helpful in finding a minimun such cycle. Is there a way to make it work?