Shortest cycle for each vertex


I have an unweighted undirected graph.How is it possible in this graph for each vertex to find the length of the shortest cycle containing it?