# Find the girth of a connected undirected graph

Write a c++ program to Find the girth of a connected undirected graph. A girth of a graph is defined as length of shortest cycle contained in the graph. Cycle means a close path in a given graph. If a connected undirected graph does not contain cycle its girth would be infinity.

Ref:

http://stackoverflow.com/questions/12890106/find-the-girth-of-a-graph

http://webcourse.cs.technion.ac.il/234247/Winter2003-2004/ho/WCFiles/Girth.pdf

https://github.com/jaspervdj/Genus/blob/master/src/genus/FindGirth.java

## Leave a Reply