Changeset 2700f5e for molecuilder/src/moleculelist.cpp
- Timestamp:
- May 9, 2008, 1:49:57 PM (17 years ago)
- Children:
- 0716ff4
- Parents:
- 59ddad
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
molecuilder/src/moleculelist.cpp
r59ddad r2700f5e 409 409 * \param *&RootStack stack to be filled 410 410 * \param *AtomMask defines true/false per global Atom::nr to mask in/out each nuclear site 411 * \param Order desired bond order for all sites412 411 * \param &FragmentCounter counts through the fragments in this MoleculeLeafClass 413 412 * \return true - stack is non-empty, fragmentation necessary, false - stack is empty, no more sites to update 414 413 */ 415 bool MoleculeLeafClass::FillRootStackForSubgraphs(ofstream *out, KeyStack *&RootStack, bool *AtomMask, int Order, int&FragmentCounter)414 bool MoleculeLeafClass::FillRootStackForSubgraphs(ofstream *out, KeyStack *&RootStack, bool *AtomMask, int &FragmentCounter) 416 415 { 417 416 atom *Walker = NULL, *Father = NULL; 418 417 419 418 if (RootStack != NULL) { 420 if (Order == -1) { // means we want to increase order adaptively 421 cerr << "Adaptive chosing of sites not yet implemented!" << endl; 422 } else { // means we just want to increase it at every site by one 423 // find first root candidates 424 if (&(RootStack[FragmentCounter]) != NULL) { 425 RootStack[FragmentCounter].clear(); 426 Walker = Leaf->start; 427 while (Walker->next != Leaf->end) { // go through all (non-hydrogen) atoms 428 Walker = Walker->next; 429 Father = Walker->GetTrueFather(); 430 if (AtomMask[Father->nr]) // apply mask 431 #ifdef ADDHYDROGEN 432 if (Walker->type->Z != 1) // skip hydrogen 433 #endif 434 if (Father->AdaptiveOrder < Order) // only if Order is still greater 435 RootStack[FragmentCounter].push_front(Walker->nr); 436 } 437 if (next != NULL) 438 next->FillRootStackForSubgraphs(out, RootStack, AtomMask, Order, ++FragmentCounter); 439 } else { 440 *out << Verbose(1) << "Rootstack[" << FragmentCounter << "] is NULL." << endl; 441 return false; 442 } 419 // find first root candidates 420 if (&(RootStack[FragmentCounter]) != NULL) { 421 RootStack[FragmentCounter].clear(); 422 Walker = Leaf->start; 423 while (Walker->next != Leaf->end) { // go through all (non-hydrogen) atoms 424 Walker = Walker->next; 425 Father = Walker->GetTrueFather(); 426 if (AtomMask[Father->nr]) // apply mask 427 #ifdef ADDHYDROGEN 428 if (Walker->type->Z != 1) // skip hydrogen 429 #endif 430 RootStack[FragmentCounter].push_front(Walker->nr); 431 } 432 if (next != NULL) 433 next->FillRootStackForSubgraphs(out, RootStack, AtomMask, ++FragmentCounter); 434 } else { 435 *out << Verbose(1) << "Rootstack[" << FragmentCounter << "] is NULL." << endl; 436 return false; 443 437 } 444 438 FragmentCounter--; … … 553 547 { 554 548 KeySet *TempSet = new KeySet; 555 for(Graph::iterator runner = FragmentList[FragmentCounter]->begin(); runner != FragmentList[FragmentCounter]->end(); runner++) { 556 for(KeySet::iterator sprinter = (*runner).first.begin(); sprinter != (*runner).first.end(); sprinter++) 557 TempSet->insert((Leaf->FindAtom(*sprinter))->GetTrueFather()->nr); 558 TotalGraph.insert(GraphPair(*TempSet, pair<int,double>(TotalNumberOfKeySets++, (*runner).second.second))); 559 TempSet->clear(); 560 } 561 delete(TempSet); 549 if (FragmentList[FragmentCounter] != NULL) { 550 for(Graph::iterator runner = FragmentList[FragmentCounter]->begin(); runner != FragmentList[FragmentCounter]->end(); runner++) { 551 for(KeySet::iterator sprinter = (*runner).first.begin(); sprinter != (*runner).first.end(); sprinter++) 552 TempSet->insert((Leaf->FindAtom(*sprinter))->GetTrueFather()->nr); 553 TotalGraph.insert(GraphPair(*TempSet, pair<int,double>(TotalNumberOfKeySets++, (*runner).second.second))); 554 TempSet->clear(); 555 } 556 delete(TempSet); 557 } else { 558 *out << Verbose(1) << "FragmentList is NULL." << endl; 559 } 562 560 if (next != NULL) 563 561 next->TranslateIndicesToGlobalIDs(out, FragmentList, ++FragmentCounter, TotalNumberOfKeySets, TotalGraph);
Note:
See TracChangeset
for help on using the changeset viewer.