1 | /*
|
---|
2 | * Project: MoleCuilder
|
---|
3 | * Description: creates and alters molecular systems
|
---|
4 | * Copyright (C) 2010-2012 University of Bonn. All rights reserved.
|
---|
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/>.
|
---|
21 | */
|
---|
22 |
|
---|
23 | /*
|
---|
24 | * DepthFirstSearchAction.cpp
|
---|
25 | *
|
---|
26 | * Created on: May 9, 2010
|
---|
27 | * Author: heber
|
---|
28 | */
|
---|
29 |
|
---|
30 | // include config.h
|
---|
31 | #ifdef HAVE_CONFIG_H
|
---|
32 | #include <config.h>
|
---|
33 | #endif
|
---|
34 |
|
---|
35 | #include "CodePatterns/MemDebug.hpp"
|
---|
36 |
|
---|
37 | #include "Atom/atom.hpp"
|
---|
38 | #include "CodePatterns/Log.hpp"
|
---|
39 | #include "Fragmentation/HydrogenSaturation_enum.hpp"
|
---|
40 | #include "Graph/CyclicStructureAnalysis.hpp"
|
---|
41 | #include "Graph/DepthFirstSearchAnalysis.hpp"
|
---|
42 | #include "Graph/ListOfLocalAtoms.hpp"
|
---|
43 | #include "molecule.hpp"
|
---|
44 | #include "MoleculeLeafClass.hpp"
|
---|
45 |
|
---|
46 | #include <iostream>
|
---|
47 | #include <string>
|
---|
48 |
|
---|
49 | #include "Actions/GraphAction/DepthFirstSearchAction.hpp"
|
---|
50 |
|
---|
51 | using namespace MoleCuilder;
|
---|
52 |
|
---|
53 | // and construct the stuff
|
---|
54 | #include "DepthFirstSearchAction.def"
|
---|
55 | #include "Action_impl_pre.hpp"
|
---|
56 | /** =========== define the function ====================== */
|
---|
57 | ActionState::ptr GraphDepthFirstSearchAction::performCall() {
|
---|
58 | LOG(1, "Depth-First-Search Analysis.");
|
---|
59 | ListOfLocalAtoms_t ListOfAtoms;
|
---|
60 | std::deque<bond::ptr > *LocalBackEdgeStack = NULL;
|
---|
61 | DepthFirstSearchAnalysis DFS;
|
---|
62 | DFS();
|
---|
63 | DFS.UpdateMoleculeStructure();
|
---|
64 | MoleculeLeafClass *Subgraphs = DFS.getMoleculeStructure();
|
---|
65 | if (Subgraphs != NULL) {
|
---|
66 | int FragmentCounter = 0;
|
---|
67 | while (Subgraphs->next != NULL) {
|
---|
68 | Subgraphs = Subgraphs->next;
|
---|
69 | ListOfAtoms.clear();
|
---|
70 | Subgraphs->Leaf->FillListOfLocalAtoms(ListOfAtoms, Subgraphs->Leaf->getAtomCount());
|
---|
71 | LocalBackEdgeStack = new std::deque<bond::ptr >; // no need to have it Subgraphs->Leaf->BondCount size
|
---|
72 | DFS.PickLocalBackEdges(ListOfAtoms, LocalBackEdgeStack);
|
---|
73 | CyclicStructureAnalysis CycleAnalysis(params.HowtoTreatHydrogen.get() ? ExcludeHydrogen : IncludeHydrogen);
|
---|
74 | CycleAnalysis(LocalBackEdgeStack);
|
---|
75 | delete(LocalBackEdgeStack);
|
---|
76 | Subgraphs->Leaf = NULL;
|
---|
77 | delete(Subgraphs->previous);
|
---|
78 | FragmentCounter++;
|
---|
79 | }
|
---|
80 | Subgraphs->Leaf = NULL;
|
---|
81 | delete(Subgraphs);
|
---|
82 | }
|
---|
83 | return Action::success;
|
---|
84 | }
|
---|
85 |
|
---|
86 | ActionState::ptr GraphDepthFirstSearchAction::performUndo(ActionState::ptr _state) {
|
---|
87 | return Action::success;
|
---|
88 | }
|
---|
89 |
|
---|
90 | ActionState::ptr GraphDepthFirstSearchAction::performRedo(ActionState::ptr _state){
|
---|
91 | return Action::success;
|
---|
92 | }
|
---|
93 |
|
---|
94 | bool GraphDepthFirstSearchAction::canUndo() {
|
---|
95 | return true;
|
---|
96 | }
|
---|
97 |
|
---|
98 | bool GraphDepthFirstSearchAction::shouldUndo() {
|
---|
99 | return true;
|
---|
100 | }
|
---|
101 | /** =========== end of function ====================== */
|
---|