| [bcf653] | 1 | /* | 
|---|
|  | 2 | * Project: MoleCuilder | 
|---|
|  | 3 | * Description: creates and alters molecular systems | 
|---|
| [0aa122] | 4 | * Copyright (C)  2010-2012 University of Bonn. All rights reserved. | 
|---|
| [94d5ac6] | 5 | * | 
|---|
|  | 6 | * | 
|---|
|  | 7 | *   This file is part of MoleCuilder. | 
|---|
|  | 8 | * | 
|---|
|  | 9 | *    MoleCuilder is free software: you can redistribute it and/or modify | 
|---|
|  | 10 | *    it under the terms of the GNU General Public License as published by | 
|---|
|  | 11 | *    the Free Software Foundation, either version 2 of the License, or | 
|---|
|  | 12 | *    (at your option) any later version. | 
|---|
|  | 13 | * | 
|---|
|  | 14 | *    MoleCuilder is distributed in the hope that it will be useful, | 
|---|
|  | 15 | *    but WITHOUT ANY WARRANTY; without even the implied warranty of | 
|---|
|  | 16 | *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the | 
|---|
|  | 17 | *    GNU General Public License for more details. | 
|---|
|  | 18 | * | 
|---|
|  | 19 | *    You should have received a copy of the GNU General Public License | 
|---|
|  | 20 | *    along with MoleCuilder.  If not, see <http://www.gnu.org/licenses/>. | 
|---|
| [bcf653] | 21 | */ | 
|---|
|  | 22 |  | 
|---|
| [97ebf8] | 23 | /* | 
|---|
|  | 24 | * DepthFirstSearchAction.cpp | 
|---|
|  | 25 | * | 
|---|
|  | 26 | *  Created on: May 9, 2010 | 
|---|
|  | 27 | *      Author: heber | 
|---|
|  | 28 | */ | 
|---|
|  | 29 |  | 
|---|
| [bf3817] | 30 | // include config.h | 
|---|
|  | 31 | #ifdef HAVE_CONFIG_H | 
|---|
|  | 32 | #include <config.h> | 
|---|
|  | 33 | #endif | 
|---|
|  | 34 |  | 
|---|
| [9eb71b3] | 35 | //#include "CodePatterns/MemDebug.hpp" | 
|---|
| [112b09] | 36 |  | 
|---|
| [6f0841] | 37 | #include "Atom/atom.hpp" | 
|---|
| [ad011c] | 38 | #include "CodePatterns/Log.hpp" | 
|---|
| [07a47e] | 39 | #include "Fragmentation/HydrogenSaturation_enum.hpp" | 
|---|
| [e73ad9a] | 40 | #include "Graph/CyclicStructureAnalysis.hpp" | 
|---|
| [49c059] | 41 | #include "Graph/DepthFirstSearchAnalysis.hpp" | 
|---|
| [6d551c] | 42 | #include "Graph/ListOfLocalAtoms.hpp" | 
|---|
| [97ebf8] | 43 | #include "molecule.hpp" | 
|---|
| [d3abb1] | 44 | #include "MoleculeLeafClass.hpp" | 
|---|
| [97ebf8] | 45 |  | 
|---|
|  | 46 | #include <iostream> | 
|---|
|  | 47 | #include <string> | 
|---|
|  | 48 |  | 
|---|
| [d09093] | 49 | #include "Actions/GraphAction/DepthFirstSearchAction.hpp" | 
|---|
| [f394a6] | 50 |  | 
|---|
| [ce7fdc] | 51 | using namespace MoleCuilder; | 
|---|
|  | 52 |  | 
|---|
| [1fd675] | 53 | // and construct the stuff | 
|---|
|  | 54 | #include "DepthFirstSearchAction.def" | 
|---|
|  | 55 | #include "Action_impl_pre.hpp" | 
|---|
|  | 56 | /** =========== define the function ====================== */ | 
|---|
| [b5b01e] | 57 | ActionState::ptr GraphDepthFirstSearchAction::performCall() { | 
|---|
| [47d041] | 58 | LOG(1, "Depth-First-Search Analysis."); | 
|---|
| [6d551c] | 59 | ListOfLocalAtoms_t ListOfAtoms; | 
|---|
| [88c8ec] | 60 | std::deque<bond::ptr > *LocalBackEdgeStack = NULL; | 
|---|
| [49c059] | 61 | DepthFirstSearchAnalysis DFS; | 
|---|
|  | 62 | DFS(); | 
|---|
|  | 63 | DFS.UpdateMoleculeStructure(); | 
|---|
|  | 64 | MoleculeLeafClass *Subgraphs = DFS.getMoleculeStructure(); | 
|---|
| [f394a6] | 65 | if (Subgraphs != NULL) { | 
|---|
|  | 66 | int FragmentCounter = 0; | 
|---|
|  | 67 | while (Subgraphs->next != NULL) { | 
|---|
|  | 68 | Subgraphs = Subgraphs->next; | 
|---|
| [6d551c] | 69 | ListOfAtoms.clear(); | 
|---|
| [49c059] | 70 | Subgraphs->Leaf->FillListOfLocalAtoms(ListOfAtoms, Subgraphs->Leaf->getAtomCount()); | 
|---|
| [88c8ec] | 71 | LocalBackEdgeStack = new std::deque<bond::ptr >; // no need to have it Subgraphs->Leaf->BondCount size | 
|---|
| [49c059] | 72 | DFS.PickLocalBackEdges(ListOfAtoms, LocalBackEdgeStack); | 
|---|
| [9291d04] | 73 | CyclicStructureAnalysis CycleAnalysis(params.HowtoTreatHydrogen.get() ? ExcludeHydrogen : IncludeHydrogen); | 
|---|
| [e73ad9a] | 74 | CycleAnalysis(LocalBackEdgeStack); | 
|---|
| [f394a6] | 75 | delete(LocalBackEdgeStack); | 
|---|
| [49c059] | 76 | Subgraphs->Leaf = NULL; | 
|---|
| [f394a6] | 77 | delete(Subgraphs->previous); | 
|---|
|  | 78 | FragmentCounter++; | 
|---|
| [97ebf8] | 79 | } | 
|---|
| [49c059] | 80 | Subgraphs->Leaf = NULL; | 
|---|
| [f394a6] | 81 | delete(Subgraphs); | 
|---|
| [97ebf8] | 82 | } | 
|---|
| [f394a6] | 83 | return Action::success; | 
|---|
| [97ebf8] | 84 | } | 
|---|
|  | 85 |  | 
|---|
| [b5b01e] | 86 | ActionState::ptr GraphDepthFirstSearchAction::performUndo(ActionState::ptr _state) { | 
|---|
| [f394a6] | 87 | return Action::success; | 
|---|
| [97ebf8] | 88 | } | 
|---|
|  | 89 |  | 
|---|
| [b5b01e] | 90 | ActionState::ptr GraphDepthFirstSearchAction::performRedo(ActionState::ptr _state){ | 
|---|
| [f394a6] | 91 | return Action::success; | 
|---|
| [97ebf8] | 92 | } | 
|---|
|  | 93 |  | 
|---|
| [d09093] | 94 | bool GraphDepthFirstSearchAction::canUndo() { | 
|---|
| [f394a6] | 95 | return true; | 
|---|
| [97ebf8] | 96 | } | 
|---|
|  | 97 |  | 
|---|
| [d09093] | 98 | bool GraphDepthFirstSearchAction::shouldUndo() { | 
|---|
| [f394a6] | 99 | return true; | 
|---|
| [97ebf8] | 100 | } | 
|---|
| [1fd675] | 101 | /** =========== end of function ====================== */ | 
|---|