Searched refs:cyclesAvailable (Results 1 – 1 of 1) sorted by relevance
| /dports/science/rdkit/rdkit-Release_2021_03_5/Code/GraphMol/ |
| H A D | Canon.cpp | 706 const UINT_VECT &ranks, UINT_VECT &cyclesAvailable, in dfsBuildStack() argument
714 <<std::count(cyclesAvailable.begin(),cyclesAvailable.end(),1)<<std::endl; in dfsBuildStack()
758 std::find(cyclesAvailable.begin(), cyclesAvailable.end(), 1); in dfsBuildStack()
759 if (cAIt == cyclesAvailable.end()) { in dfsBuildStack()
763 unsigned int lowestRingIdx = cAIt - cyclesAvailable.begin(); in dfsBuildStack()
764 cyclesAvailable[lowestRingIdx] = 0; in dfsBuildStack()
772 cyclesAvailable[ringIdx] = 1; in dfsBuildStack()
869 cyclesAvailable, molStack, atomOrders, bondVisitOrders, in dfsBuildStack()
885 UINT_VECT &cyclesAvailable, MolStack &molStack, in canonicalDFSTraversal() argument
1058 UINT_VECT cyclesAvailable(MAX_CYCLES, 1); in canonicalizeFragment() local
[all …]
|