private boolean isNeighbor(Vertex<Integer> vertex, Vertex<Integer> destVertex){
        for(Vertex<Integer> child : vertex.getAdjacentVertexes()){
            if(child.equals(destVertex)){
                return true;
            }
        }
        return false;
    }
http://www.careercup.com/question?id=5988741646647296
Given an undirected graph find number of triangles in this graph
Find cycle of length 3. Pass parent in DFS search.
If there is a cycle check if my parent is neighbor of the the node 
which caused it to be a cycle.
src/com/interview/graph/NumberofTriangles.java