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