This article presents a method for constructing large girth column-weight 2 QC-LDPC codes. A distance graph is first constructed using an existing method. The distance graph is then converted into a Tanner graph. The proposed method could easily construct codes with girths large than 12 and is more flexible compared to previous methods. Obtained codes show good bit error rate performance comparable to that of random codes. Keywords— QC-LDPC codes, girth, distance graphs.