Ignore:
Timestamp:
Jul 23, 2009, 2:04:47 PM (16 years ago)
Author:
Frederik Heber <heber@…>
Children:
c3a303
Parents:
f39735 (diff), 1f6efb (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.
Message:

Merge branch 'AtomRemoval'

Conflicts:

molecuilder/src/builder.cpp
molecuilder/src/molecules.cpp

merges:

File:
1 edited

Legend:

Unmodified
Added
Removed
  • molecuilder/src/molecules.cpp

    rf39735 r47548d  
    18601860bool molecule::RemoveAtom(atom *pointer)
    18611861{
    1862   if (ElementsInMolecule[pointer->type->Z] != 0)  // this would indicate an error
     1862  if (ElementsInMolecule[pointer->type->Z] != 0)  { // this would indicate an error
    18631863    ElementsInMolecule[pointer->type->Z]--;  // decrease number of atom of this element
    1864   else
     1864    AtomCount--;
     1865  } else
    18651866    cerr << "ERROR: Atom " << pointer->Name << " is of element " << pointer->type->Z << " but the entry in the table of the molecule is 0!" << endl;
    18661867  if (ElementsInMolecule[pointer->type->Z] == 0)  // was last atom of this element?
     
    28452846    ColorList[i] = white;
    28462847  }
    2847  
     2848
    28482849  *out << Verbose(1) << "Back edge list - ";
    28492850  BackEdgeStack->Output(out);
     
    38523853        OtherAtom = ListOfBondsPerAtom[Walker->nr][i]->GetOtherAtom(Walker);
    38533854        if (OtherAtom == ListOfLocalAtoms[Binder->rightatom->nr]) { // found the bond
    3854             LocalStack->Push(ListOfBondsPerAtom[Walker->nr][i]);
    3855                 *out << Verbose(3) << "Found local edge " << *(ListOfBondsPerAtom[Walker->nr][i]) << "." << endl;
     3855          LocalStack->Push(ListOfBondsPerAtom[Walker->nr][i]);
     3856          *out << Verbose(3) << "Found local edge " << *(ListOfBondsPerAtom[Walker->nr][i]) << "." << endl;
    38563857          break;
    38573858        }
     
    38613862    ReferenceStack->Push(Binder);
    38623863  } while (FirstBond != Binder);
    3863  
     3864
    38643865  return status;
    38653866};
     
    40064007  Walker = start;
    40074008  while (Walker->next != end) {
    4008     Walker = Walker->next; 
     4009    Walker = Walker->next;
    40094010    *out << Verbose(4) << "Atom " << Walker->Name << "/" << Walker->nr << " with " << NumberOfBondsPerAtom[Walker->nr] << " bonds: ";
    40104011    TotalDegree = 0;
     
    43654366#ifdef ADDHYDROGEN
    43664367   && (Walker->type->Z == 1)
    4367 #endif
    4368                         ) { // search for first non-hydrogen atom
    4369     *out << Verbose(4) << "Current Root candidate is " << Walker->Name << "." << endl;
    4370     Walker = Walker->next;
    4371   }
    4372   if (Walker != end)
    4373     RootStack->Push(Walker);
    4374   else
    4375     *out << Verbose(0) << "ERROR: Could not find an appropriate Root atom!" << endl;
    4376   *out << Verbose(3) << "Root " << Walker->Name << " is on AtomStack, beginning loop through all vertices ..." << endl;
    4377 
    4378   ///// OUTER LOOP ////////////
    4379   while (!RootStack->IsEmpty()) {
    4380     // get new root vertex from atom stack
    4381     Root = RootStack->PopFirst();
    4382     ShortestPathList[Root->nr] = 0;
    4383     if (Labels[Root->nr] == -1)
    4384       Labels[Root->nr] = RunningIndex++; // prevent it from getting again on AtomStack
    4385     PredecessorList[Root->nr] = Root;
    4386     TouchedStack->Push(Root);
    4387     *out << Verbose(0) << "Root for this loop is: " << Root->Name << ".\n";
    4388 
    4389     // clear snake stack
    4390     SnakeStack->ClearStack();
    4391     //SnakeStack->TestImplementation(out, start->next);
    4392 
    4393     ///// INNER LOOP ////////////
    4394     // Problems:
    4395     // - what about cyclic bonds?
    4396     Walker = Root;
    4397     do {
    4398       *out << Verbose(1) << "Current Walker is: " << Walker->Name;
    4399       // initial setting of the new Walker: label, color, shortest path and put on stacks
    4400       if (Labels[Walker->nr] == -1)  {  // give atom a unique, monotonely increasing number
    4401         Labels[Walker->nr] = RunningIndex++;
    4402         RootStack->Push(Walker);
    4403       }
    4404       *out << ", has label " << Labels[Walker->nr];
    4405       if ((ColorVertexList[Walker->nr] == white) || ((Binder != NULL) && (ColorEdgeList[Binder->nr] == white))) {  // color it if newly discovered and push on stacks (and if within reach!)
    4406         if ((Binder != NULL) && (ColorEdgeList[Binder->nr] == white)) {
    4407           // Binder ought to be set still from last neighbour search
    4408           *out << ", coloring bond " << *Binder << " black";
    4409           ColorEdgeList[Binder->nr] = black; // mark this bond as used
    4410         }
    4411         if (ShortestPathList[Walker->nr] == -1) {
    4412           ShortestPathList[Walker->nr] = ShortestPathList[PredecessorList[Walker->nr]->nr]+1;
    4413           TouchedStack->Push(Walker); // mark every atom for lists cleanup later, whose shortest path has been changed
    4414         }
    4415         if ((ShortestPathList[Walker->nr] < Order) && (ColorVertexList[Walker->nr] != darkgray)) {  // if not already on snake stack
    4416           SnakeStack->Push(Walker);
    4417           ColorVertexList[Walker->nr] = darkgray; // mark as dark gray of on snake stack
    44184368        }
    44194369      }
     
    44524402            } else { // otherwise check its colour and element
    44534403              if (
    4454 #ifdef ADDHYDROGEN
    44554404              (OtherAtom->type->Z != 1) &&
    44564405#endif
Note: See TracChangeset for help on using the changeset viewer.