m_nNodes=2;public boolean hasCycles() {boolean[] bDone = new boolean[m_nNodes];for (int iNode = 0; iNode < m_nNodes; iNode++) {boolean bFound = false;for (int iNode2 = 0; !bFound && iNode2 < m_nNodes; iNode2++) {if (!bDone[iNode2]) {boolean bHasNoParents = true;for (int iParent = 0; iParent < m_nNodes; iParent++) {if (m_bits[iParent + iNode2 * m_nNodes] && !bDone[iParent]) {bHasNoParents = false;}}if (bHasNoParents) {bDone[iNode2] = true;bFound = true;}}}if (!bFound) {return true;}}return false;}