[5621c3] | 1 | /** \file graph.cpp
|
---|
| 2 | *
|
---|
| 3 | * Function definitions for the class graph.
|
---|
| 4 | *
|
---|
| 5 | */
|
---|
| 6 |
|
---|
| 7 | #ifndef GRAPH_HPP_
|
---|
| 8 | #define GRAPH_HPP_
|
---|
| 9 |
|
---|
[f66195] | 10 | /*********************************************** includes ***********************************/
|
---|
| 11 |
|
---|
[5621c3] | 12 | // include config.h
|
---|
| 13 | #ifdef HAVE_CONFIG_H
|
---|
| 14 | #include <config.h>
|
---|
| 15 | #endif
|
---|
| 16 |
|
---|
| 17 | // STL headers
|
---|
[f66195] | 18 | #include <deque>
|
---|
[5621c3] | 19 | #include <map>
|
---|
[f66195] | 20 | #include <set>
|
---|
| 21 |
|
---|
| 22 | /****************************************** forward declarations *****************************/
|
---|
[5621c3] | 23 |
|
---|
[f66195] | 24 | class atom;
|
---|
| 25 | class bond;
|
---|
| 26 | class config;
|
---|
| 27 | class molecule;
|
---|
[5621c3] | 28 |
|
---|
| 29 | class Graph;
|
---|
| 30 | class SubGraph;
|
---|
| 31 | class Node;
|
---|
| 32 | class Edge;
|
---|
| 33 |
|
---|
[f66195] | 34 | /********************************************** definitions *********************************/
|
---|
[5621c3] | 35 |
|
---|
| 36 | #define NodeMap pair < int, class Node* >
|
---|
| 37 | #define EdgeMap multimap < class Node*, class Edge* >
|
---|
| 38 |
|
---|
[f66195] | 39 | #define KeyStack deque<int>
|
---|
| 40 | #define KeySet set<int>
|
---|
| 41 | #define NumberValuePair pair<int, double>
|
---|
| 42 | #define Graph map <KeySet, NumberValuePair, KeyCompare >
|
---|
| 43 | #define GraphPair pair <KeySet, NumberValuePair >
|
---|
| 44 | #define KeySetTestPair pair<KeySet::iterator, bool>
|
---|
| 45 | #define GraphTestPair pair<Graph::iterator, bool>
|
---|
[5621c3] | 46 |
|
---|
| 47 |
|
---|
[f66195] | 48 | /******************************** Some small functions and/or structures **********************************/
|
---|
[5621c3] | 49 |
|
---|
[f66195] | 50 | struct KeyCompare
|
---|
[5621c3] | 51 | {
|
---|
[f66195] | 52 | bool operator() (const KeySet SubgraphA, const KeySet SubgraphB) const;
|
---|
[5621c3] | 53 | };
|
---|
| 54 |
|
---|
[f66195] | 55 | //bool operator < (KeySet SubgraphA, KeySet SubgraphB); //note: this declaration is important, otherwise normal < is used (producing wrong order)
|
---|
[e138de] | 56 | void InsertFragmentIntoGraph(struct UniqueFragments *Fragment); // Insert a KeySet into a Graph
|
---|
| 57 | void InsertGraphIntoGraph(Graph &graph1, Graph &graph2, int *counter); // Insert all KeySet's in a Graph into another Graph
|
---|
[f66195] | 58 |
|
---|
| 59 | /** Structure containing all values in power set combination generation.
|
---|
[5621c3] | 60 | */
|
---|
[f66195] | 61 | struct UniqueFragments {
|
---|
| 62 | config *configuration;
|
---|
| 63 | atom *Root;
|
---|
| 64 | Graph *Leaflet;
|
---|
| 65 | KeySet *FragmentSet;
|
---|
| 66 | int ANOVAOrder;
|
---|
| 67 | int FragmentCounter;
|
---|
| 68 | int CurrentIndex;
|
---|
| 69 | double TEFactor;
|
---|
| 70 | int *ShortestPathList;
|
---|
| 71 | bool **UsedList;
|
---|
| 72 | bond **BondsPerSPList;
|
---|
| 73 | int *BondsPerSPCount;
|
---|
[5621c3] | 74 | };
|
---|
| 75 |
|
---|
[f66195] | 76 | /********************************************** declarations *******************************/
|
---|
| 77 |
|
---|
| 78 | ///** Graph class containing the graphs behind molecules.
|
---|
| 79 | // */
|
---|
| 80 | //class Graph
|
---|
| 81 | //{
|
---|
| 82 | // NodeMap ListOfNodes; //!< tree-list of all nodes in this graph
|
---|
| 83 | // EdgeMap ListOfEdges; //!< tree-multi-list of all nodes, referenced to node id
|
---|
| 84 | //};
|
---|
| 85 | //
|
---|
| 86 | ///** Class describing subgraphs of the Class \a Graph.
|
---|
| 87 | // * SubGraph has its own node and edge lists, however also a pointer to its father graph
|
---|
| 88 | // * and hence access to its list as well.
|
---|
| 89 | // */
|
---|
| 90 | //class SubGraph : class Graph
|
---|
| 91 | //{
|
---|
| 92 | // class Graph *FatherGraph; //!< Graph whose subgraph we are
|
---|
| 93 | //};
|
---|
| 94 | //
|
---|
| 95 | ///** Class containing the nodes of a graph.
|
---|
| 96 | // */
|
---|
| 97 | //class Node
|
---|
| 98 | //{
|
---|
| 99 | // int id; //!< individual id of the node
|
---|
| 100 | // char *Name; //!< Name of the node for pretty printing
|
---|
| 101 | //};
|
---|
| 102 | //
|
---|
| 103 | ///** Class containing egdes in a Graph strructure.
|
---|
| 104 | // */
|
---|
| 105 | //class Edge
|
---|
| 106 | //{
|
---|
| 107 | // class Node *leftnode; //!< pointer to first node
|
---|
| 108 | // class Node *atomnode; //!< pointer to second node
|
---|
| 109 | //};
|
---|
| 110 |
|
---|
[5621c3] | 111 |
|
---|
| 112 |
|
---|
| 113 | #endif /*GRAPH_HPP_*/
|
---|