| [97ebf8] | 1 | /*
 | 
|---|
 | 2 |  * DepthFirstSearchAction.cpp
 | 
|---|
 | 3 |  *
 | 
|---|
 | 4 |  *  Created on: May 9, 2010
 | 
|---|
 | 5 |  *      Author: heber
 | 
|---|
 | 6 |  */
 | 
|---|
 | 7 | 
 | 
|---|
| [112b09] | 8 | #include "Helpers/MemDebug.hpp"
 | 
|---|
 | 9 | 
 | 
|---|
| [97ebf8] | 10 | #include "Actions/FragmentationAction/DepthFirstSearchAction.hpp"
 | 
|---|
| [0430e3] | 11 | #include "Actions/ActionRegistry.hpp"
 | 
|---|
| [97ebf8] | 12 | #include "atom.hpp"
 | 
|---|
| [a3fded] | 13 | #include "bondgraph.hpp"
 | 
|---|
| [97ebf8] | 14 | #include "config.hpp"
 | 
|---|
| [952f38] | 15 | #include "Helpers/Log.hpp"
 | 
|---|
| [97ebf8] | 16 | #include "molecule.hpp"
 | 
|---|
 | 17 | #include "Descriptors/MoleculeDescriptor.hpp"
 | 
|---|
 | 18 | #include "Descriptors/MoleculeIdDescriptor.hpp"
 | 
|---|
 | 19 | #include "stackclass.hpp"
 | 
|---|
| [952f38] | 20 | #include "Helpers/Verbose.hpp"
 | 
|---|
| [97ebf8] | 21 | #include "World.hpp"
 | 
|---|
 | 22 | 
 | 
|---|
 | 23 | #include <iostream>
 | 
|---|
 | 24 | #include <string>
 | 
|---|
 | 25 | 
 | 
|---|
 | 26 | using namespace std;
 | 
|---|
 | 27 | 
 | 
|---|
 | 28 | #include "UIElements/UIFactory.hpp"
 | 
|---|
 | 29 | #include "UIElements/Dialog.hpp"
 | 
|---|
| [861874] | 30 | #include "Actions/ValueStorage.hpp"
 | 
|---|
| [97ebf8] | 31 | 
 | 
|---|
 | 32 | const char FragmentationDepthFirstSearchAction::NAME[] = "depth-first-search";
 | 
|---|
 | 33 | 
 | 
|---|
 | 34 | FragmentationDepthFirstSearchAction::FragmentationDepthFirstSearchAction() :
 | 
|---|
 | 35 |   Action(NAME)
 | 
|---|
 | 36 | {}
 | 
|---|
 | 37 | 
 | 
|---|
 | 38 | FragmentationDepthFirstSearchAction::~FragmentationDepthFirstSearchAction()
 | 
|---|
 | 39 | {}
 | 
|---|
 | 40 | 
 | 
|---|
| [4ff081] | 41 | void FragmentationDepthFirstSearch(double distance) {
 | 
|---|
 | 42 |   ValueStorage::getInstance().setCurrentValue(FragmentationDepthFirstSearchAction::NAME, distance);
 | 
|---|
 | 43 |   ActionRegistry::getInstance().getActionByName(FragmentationDepthFirstSearchAction::NAME)->call(Action::NonInteractive);
 | 
|---|
 | 44 | };
 | 
|---|
 | 45 | 
 | 
|---|
| [047878] | 46 | Dialog* FragmentationDepthFirstSearchAction::fillDialog(Dialog *dialog) {
 | 
|---|
 | 47 |   ASSERT(dialog,"No Dialog given when filling action dialog");
 | 
|---|
| [f394a6] | 48 | 
 | 
|---|
 | 49 |   dialog->queryDouble(NAME, ValueStorage::getInstance().getDescription(NAME));
 | 
|---|
 | 50 | 
 | 
|---|
 | 51 |   return dialog;
 | 
|---|
 | 52 | }
 | 
|---|
 | 53 | 
 | 
|---|
 | 54 | Action::state_ptr FragmentationDepthFirstSearchAction::performCall() {
 | 
|---|
| [97ebf8] | 55 |   double distance;
 | 
|---|
 | 56 | 
 | 
|---|
| [f394a6] | 57 |   ValueStorage::getInstance().queryCurrentValue(NAME, distance);
 | 
|---|
 | 58 | 
 | 
|---|
 | 59 |   DoLog(1) && (Log() << Verbose(1) << "Depth-First-Search Analysis." << endl);
 | 
|---|
 | 60 |   molecule * const mol = World::getInstance().getMolecule(MoleculeById(0));
 | 
|---|
 | 61 |   MoleculeLeafClass *Subgraphs = NULL;      // list of subgraphs from DFS analysis
 | 
|---|
 | 62 |   int *MinimumRingSize = new int[mol->getAtomCount()];
 | 
|---|
 | 63 |   atom **ListOfAtoms = NULL;
 | 
|---|
 | 64 |   class StackClass<bond *> *BackEdgeStack = NULL;
 | 
|---|
 | 65 |   class StackClass<bond *> *LocalBackEdgeStack = NULL;
 | 
|---|
 | 66 |   mol->CreateAdjacencyList(distance, World::getInstance().getConfig()->GetIsAngstroem(), &BondGraph::CovalentMinMaxDistance, NULL);
 | 
|---|
 | 67 |   Subgraphs = mol->DepthFirstSearchAnalysis(BackEdgeStack);
 | 
|---|
 | 68 |   if (Subgraphs != NULL) {
 | 
|---|
 | 69 |     int FragmentCounter = 0;
 | 
|---|
 | 70 |     while (Subgraphs->next != NULL) {
 | 
|---|
 | 71 |       Subgraphs = Subgraphs->next;
 | 
|---|
 | 72 |       ListOfAtoms = NULL;
 | 
|---|
 | 73 |       Subgraphs->FillBondStructureFromReference(mol, ListOfAtoms, false);  // we want to keep the created ListOfLocalAtoms
 | 
|---|
 | 74 |       LocalBackEdgeStack = new StackClass<bond *> (Subgraphs->Leaf->BondCount);
 | 
|---|
 | 75 |       Subgraphs->Leaf->PickLocalBackEdges(ListOfAtoms, BackEdgeStack, LocalBackEdgeStack);
 | 
|---|
 | 76 |       Subgraphs->Leaf->CyclicStructureAnalysis(LocalBackEdgeStack, MinimumRingSize);
 | 
|---|
 | 77 |       delete(LocalBackEdgeStack);
 | 
|---|
 | 78 |       delete(Subgraphs->previous);
 | 
|---|
 | 79 |       delete[](ListOfAtoms);  // and here we remove it
 | 
|---|
 | 80 |       FragmentCounter++;
 | 
|---|
| [97ebf8] | 81 |     }
 | 
|---|
| [f394a6] | 82 |     delete(Subgraphs);
 | 
|---|
| [97ebf8] | 83 |   }
 | 
|---|
| [f394a6] | 84 |   delete(BackEdgeStack);
 | 
|---|
 | 85 |   delete[](MinimumRingSize);
 | 
|---|
 | 86 |   return Action::success;
 | 
|---|
| [97ebf8] | 87 | }
 | 
|---|
 | 88 | 
 | 
|---|
 | 89 | Action::state_ptr FragmentationDepthFirstSearchAction::performUndo(Action::state_ptr _state) {
 | 
|---|
| [f394a6] | 90 |   return Action::success;
 | 
|---|
| [97ebf8] | 91 | }
 | 
|---|
 | 92 | 
 | 
|---|
 | 93 | Action::state_ptr FragmentationDepthFirstSearchAction::performRedo(Action::state_ptr _state){
 | 
|---|
| [f394a6] | 94 |   return Action::success;
 | 
|---|
| [97ebf8] | 95 | }
 | 
|---|
 | 96 | 
 | 
|---|
 | 97 | bool FragmentationDepthFirstSearchAction::canUndo() {
 | 
|---|
| [f394a6] | 98 |   return true;
 | 
|---|
| [97ebf8] | 99 | }
 | 
|---|
 | 100 | 
 | 
|---|
 | 101 | bool FragmentationDepthFirstSearchAction::shouldUndo() {
 | 
|---|
| [f394a6] | 102 |   return true;
 | 
|---|
| [97ebf8] | 103 | }
 | 
|---|
 | 104 | 
 | 
|---|
 | 105 | const string FragmentationDepthFirstSearchAction::getName() {
 | 
|---|
 | 106 |   return NAME;
 | 
|---|
 | 107 | }
 | 
|---|