| 1 | /*
|
|---|
| 2 | * Project: MoleCuilder
|
|---|
| 3 | * Description: creates and alters molecular systems
|
|---|
| 4 | * Copyright (C) 2010 University of Bonn. All rights reserved.
|
|---|
| 5 | * Please see the LICENSE file or "Copyright notice" in builder.cpp for details.
|
|---|
| 6 | */
|
|---|
| 7 |
|
|---|
| 8 | /** \file graph.cpp
|
|---|
| 9 | *
|
|---|
| 10 | * Function implementations for the class graph.
|
|---|
| 11 | *
|
|---|
| 12 | */
|
|---|
| 13 |
|
|---|
| 14 | // include config.h
|
|---|
| 15 | #ifdef HAVE_CONFIG_H
|
|---|
| 16 | #include <config.h>
|
|---|
| 17 | #endif
|
|---|
| 18 |
|
|---|
| 19 | #include "CodePatterns/MemDebug.hpp"
|
|---|
| 20 |
|
|---|
| 21 | using namespace std;
|
|---|
| 22 |
|
|---|
| 23 | #include "atom.hpp"
|
|---|
| 24 | #include "Bond/bond.hpp"
|
|---|
| 25 | #include "config.hpp"
|
|---|
| 26 | #include "graph.hpp"
|
|---|
| 27 | #include "CodePatterns/Verbose.hpp"
|
|---|
| 28 | #include "CodePatterns/Log.hpp"
|
|---|
| 29 | #include "molecule.hpp"
|
|---|
| 30 |
|
|---|
| 31 | /***************************************** Implementations for graph classes ********************************/
|
|---|
| 32 |
|
|---|
| 33 | ///** Constructor of class Graph.
|
|---|
| 34 | // */
|
|---|
| 35 | //Graph::Graph()
|
|---|
| 36 | //{
|
|---|
| 37 | //};
|
|---|
| 38 | //
|
|---|
| 39 | ///** Destructor of class Graph.
|
|---|
| 40 | // * Destructor does release memory for nodes and edges contained in its lists as well.
|
|---|
| 41 | // */
|
|---|
| 42 | //Graph::~Graph()
|
|---|
| 43 | //{
|
|---|
| 44 | //};
|
|---|
| 45 | //
|
|---|
| 46 | ///** Constructor of class SubGraph.
|
|---|
| 47 | // */
|
|---|
| 48 | //SubGraph::SubGraph()
|
|---|
| 49 | //{
|
|---|
| 50 | //};
|
|---|
| 51 | //
|
|---|
| 52 | ///** Destructor of class SubGraph.
|
|---|
| 53 | // * Note that destructor does not deallocate either nodes or edges! (this is done by its subgraph!)
|
|---|
| 54 | // */
|
|---|
| 55 | //SubGraph::~SubGraph()
|
|---|
| 56 | //{
|
|---|
| 57 | //};
|
|---|
| 58 | //
|
|---|
| 59 | ///** Constructor of class Node.
|
|---|
| 60 | // */
|
|---|
| 61 | //Node::Node()
|
|---|
| 62 | //{
|
|---|
| 63 | //};
|
|---|
| 64 | //
|
|---|
| 65 | ///** Destructor of class Node.
|
|---|
| 66 | // */
|
|---|
| 67 | //Node::~Node()
|
|---|
| 68 | //{
|
|---|
| 69 | //};
|
|---|
| 70 | //
|
|---|
| 71 | ///** Constructor of class Edge.
|
|---|
| 72 | // */
|
|---|
| 73 | //Edge::Edge()
|
|---|
| 74 | //{
|
|---|
| 75 | //};
|
|---|
| 76 | //
|
|---|
| 77 | ///** Destructor of class Edge.
|
|---|
| 78 | // */
|
|---|
| 79 | //Edge::~Edge()
|
|---|
| 80 | //{
|
|---|
| 81 | //};
|
|---|
| 82 |
|
|---|
| 83 |
|
|---|
| 84 | //bool operator < (KeySet SubgraphA, KeySet SubgraphB)
|
|---|
| 85 | //{
|
|---|
| 86 | // return KeyCompare(SubgraphA, SubgraphB);
|
|---|
| 87 | //};
|
|---|
| 88 |
|
|---|
| 89 | //void inline InsertIntoGraph(KeyStack &stack, Graph &graph, int *counter, double factor)
|
|---|
| 90 | //{
|
|---|
| 91 | // // copy stack contents to set and call overloaded function again
|
|---|
| 92 | // KeySet set;
|
|---|
| 93 | // for(KeyStack::iterator runner = stack.begin(); runner != stack.begin(); runner++)
|
|---|
| 94 | // set.insert((*runner));
|
|---|
| 95 | // InsertIntoGraph(set, graph, counter, factor);
|
|---|
| 96 | //};
|
|---|
| 97 |
|
|---|
| 98 | /** Inserts each KeySet in \a graph2 into \a graph1.
|
|---|
| 99 | * \param *out output stream for debugging
|
|---|
| 100 | * \param graph1 first (dest) graph
|
|---|
| 101 | * \param graph2 second (source) graph
|
|---|
| 102 | * \param *counter keyset counter that gets increased
|
|---|
| 103 | */
|
|---|
| 104 | void InsertGraphIntoGraph(Graph &graph1, Graph &graph2, int *counter)
|
|---|
| 105 | {
|
|---|
| 106 | GraphTestPair testGraphInsert;
|
|---|
| 107 |
|
|---|
| 108 | for(Graph::iterator runner = graph2.begin(); runner != graph2.end(); runner++) {
|
|---|
| 109 | testGraphInsert = graph1.insert(GraphPair ((*runner).first,pair<int,double>((*counter)++,((*runner).second).second))); // store fragment number and current factor
|
|---|
| 110 | if (testGraphInsert.second) {
|
|---|
| 111 | DoLog(2) && (Log() << Verbose(2) << "KeySet " << (*counter)-1 << " successfully inserted." << endl);
|
|---|
| 112 | } else {
|
|---|
| 113 | DoLog(2) && (Log() << Verbose(2) << "KeySet " << (*counter)-1 << " failed to insert, present fragment is " << ((*(testGraphInsert.first)).second).first << endl);
|
|---|
| 114 | ((*(testGraphInsert.first)).second).second += (*runner).second.second;
|
|---|
| 115 | DoLog(2) && (Log() << Verbose(2) << "New factor is " << (*(testGraphInsert.first)).second.second << "." << endl);
|
|---|
| 116 | }
|
|---|
| 117 | }
|
|---|
| 118 | };
|
|---|
| 119 |
|
|---|
