| 1 | /* | 
|---|
| 2 | * Project: MoleCuilder | 
|---|
| 3 | * Description: creates and alters molecular systems | 
|---|
| 4 | * Copyright (C)  2010-2012 University of Bonn. All rights reserved. | 
|---|
| 5 | * Please see the LICENSE file or "Copyright notice" in builder.cpp for details. | 
|---|
| 6 | */ | 
|---|
| 7 |  | 
|---|
| 8 | /* | 
|---|
| 9 | * DepthFirstSearchAction.cpp | 
|---|
| 10 | * | 
|---|
| 11 | *  Created on: May 9, 2010 | 
|---|
| 12 | *      Author: heber | 
|---|
| 13 | */ | 
|---|
| 14 |  | 
|---|
| 15 | // include config.h | 
|---|
| 16 | #ifdef HAVE_CONFIG_H | 
|---|
| 17 | #include <config.h> | 
|---|
| 18 | #endif | 
|---|
| 19 |  | 
|---|
| 20 | #include "CodePatterns/MemDebug.hpp" | 
|---|
| 21 |  | 
|---|
| 22 | #include "Atom/atom.hpp" | 
|---|
| 23 | #include "CodePatterns/Log.hpp" | 
|---|
| 24 | #include "Fragmentation/HydrogenSaturation_enum.hpp" | 
|---|
| 25 | #include "Graph/CyclicStructureAnalysis.hpp" | 
|---|
| 26 | #include "Graph/DepthFirstSearchAnalysis.hpp" | 
|---|
| 27 | #include "molecule.hpp" | 
|---|
| 28 | #include "MoleculeLeafClass.hpp" | 
|---|
| 29 |  | 
|---|
| 30 | #include <iostream> | 
|---|
| 31 | #include <string> | 
|---|
| 32 |  | 
|---|
| 33 | #include "Actions/GraphAction/DepthFirstSearchAction.hpp" | 
|---|
| 34 |  | 
|---|
| 35 | using namespace MoleCuilder; | 
|---|
| 36 |  | 
|---|
| 37 | // and construct the stuff | 
|---|
| 38 | #include "DepthFirstSearchAction.def" | 
|---|
| 39 | #include "Action_impl_pre.hpp" | 
|---|
| 40 | /** =========== define the function ====================== */ | 
|---|
| 41 | Action::state_ptr GraphDepthFirstSearchAction::performCall() { | 
|---|
| 42 | LOG(1, "Depth-First-Search Analysis."); | 
|---|
| 43 | atom **ListOfAtoms = NULL; | 
|---|
| 44 | std::deque<bond *> *LocalBackEdgeStack = NULL; | 
|---|
| 45 | DepthFirstSearchAnalysis DFS; | 
|---|
| 46 | DFS(); | 
|---|
| 47 | DFS.UpdateMoleculeStructure(); | 
|---|
| 48 | MoleculeLeafClass *Subgraphs = DFS.getMoleculeStructure(); | 
|---|
| 49 | if (Subgraphs != NULL) { | 
|---|
| 50 | int FragmentCounter = 0; | 
|---|
| 51 | while (Subgraphs->next != NULL) { | 
|---|
| 52 | Subgraphs = Subgraphs->next; | 
|---|
| 53 | ListOfAtoms = NULL; | 
|---|
| 54 | Subgraphs->Leaf->FillListOfLocalAtoms(ListOfAtoms, Subgraphs->Leaf->getAtomCount()); | 
|---|
| 55 | LocalBackEdgeStack = new std::deque<bond *>; // no need to have it Subgraphs->Leaf->BondCount size | 
|---|
| 56 | DFS.PickLocalBackEdges(ListOfAtoms, LocalBackEdgeStack); | 
|---|
| 57 | CyclicStructureAnalysis CycleAnalysis(params.DoSaturation ? DoSaturate : DontSaturate); | 
|---|
| 58 | CycleAnalysis(LocalBackEdgeStack); | 
|---|
| 59 | delete(LocalBackEdgeStack); | 
|---|
| 60 | Subgraphs->Leaf = NULL; | 
|---|
| 61 | delete(Subgraphs->previous); | 
|---|
| 62 | delete[](ListOfAtoms);  // allocated by FillListOfLocalAtoms | 
|---|
| 63 | FragmentCounter++; | 
|---|
| 64 | } | 
|---|
| 65 | Subgraphs->Leaf = NULL; | 
|---|
| 66 | delete(Subgraphs); | 
|---|
| 67 | } | 
|---|
| 68 | return Action::success; | 
|---|
| 69 | } | 
|---|
| 70 |  | 
|---|
| 71 | Action::state_ptr GraphDepthFirstSearchAction::performUndo(Action::state_ptr _state) { | 
|---|
| 72 | return Action::success; | 
|---|
| 73 | } | 
|---|
| 74 |  | 
|---|
| 75 | Action::state_ptr GraphDepthFirstSearchAction::performRedo(Action::state_ptr _state){ | 
|---|
| 76 | return Action::success; | 
|---|
| 77 | } | 
|---|
| 78 |  | 
|---|
| 79 | bool GraphDepthFirstSearchAction::canUndo() { | 
|---|
| 80 | return true; | 
|---|
| 81 | } | 
|---|
| 82 |  | 
|---|
| 83 | bool GraphDepthFirstSearchAction::shouldUndo() { | 
|---|
| 84 | return true; | 
|---|
| 85 | } | 
|---|
| 86 | /** =========== end of function ====================== */ | 
|---|