| 1 | /*
 | 
|---|
| 2 |  * BreadthFirstSearchAdd.hpp
 | 
|---|
| 3 |  *
 | 
|---|
| 4 |  *  Created on: Feb 16, 2011
 | 
|---|
| 5 |  *      Author: heber
 | 
|---|
| 6 |  */
 | 
|---|
| 7 | 
 | 
|---|
| 8 | #ifndef BREADTHFIRSTSEARCHADD_HPP_
 | 
|---|
| 9 | #define BREADTHFIRSTSEARCHADD_HPP_
 | 
|---|
| 10 | 
 | 
|---|
| 11 | // include config.h
 | 
|---|
| 12 | #ifdef HAVE_CONFIG_H
 | 
|---|
| 13 | #include <config.h>
 | 
|---|
| 14 | #endif
 | 
|---|
| 15 | 
 | 
|---|
| 16 | #include <deque>
 | 
|---|
| 17 | #include <map>
 | 
|---|
| 18 | 
 | 
|---|
| 19 | #include "Bond/GraphEdge.hpp"
 | 
|---|
| 20 | #include "Helpers/defs.hpp"
 | 
|---|
| 21 | #include "types.hpp"
 | 
|---|
| 22 | 
 | 
|---|
| 23 | class atom;
 | 
|---|
| 24 | class bond;
 | 
|---|
| 25 | class molecule;
 | 
|---|
| 26 | 
 | 
|---|
| 27 | class BreadthFirstSearchAdd
 | 
|---|
| 28 | {
 | 
|---|
| 29 | public:
 | 
|---|
| 30 |   BreadthFirstSearchAdd(atom *&_Root, int _BondOrder, bool _IsAngstroem);
 | 
|---|
| 31 |   ~BreadthFirstSearchAdd();
 | 
|---|
| 32 | 
 | 
|---|
| 33 |   /** Reinitializes the structure for a new BFS run.
 | 
|---|
| 34 |    *
 | 
|---|
| 35 |    * @param _Root Root atom to start BFS from
 | 
|---|
| 36 |    * @param _BondOrder horizon in bond counts when to stop BFS
 | 
|---|
| 37 |    */
 | 
|---|
| 38 |   void Init(atom *&_Root, int _BondOrder);
 | 
|---|
| 39 | 
 | 
|---|
| 40 |   /** Adds atoms up to \a BondCount distance from \a *Root and notes them down in \a AddedAtomList.
 | 
|---|
| 41 |    * Gray vertices are always enqueued in an std::deque<atom *> FIFO queue, the rest is usual BFS with adding vertices found was
 | 
|---|
| 42 |    * white and putting into queue.
 | 
|---|
| 43 |    * \param *Mol Molecule class to add atoms to
 | 
|---|
| 44 |    * \param *Root root vertex for BFS
 | 
|---|
| 45 |    * \param *Bond bond not to look beyond
 | 
|---|
| 46 |    * \param BondOrder maximum distance for vertices to add
 | 
|---|
| 47 |    * \param IsAngstroem lengths are in angstroem or bohrradii
 | 
|---|
| 48 |    */
 | 
|---|
| 49 |   void operator()(molecule *Mol, atom *_Root, bond *Bond, int _BondOrder);
 | 
|---|
| 50 | 
 | 
|---|
| 51 | private:
 | 
|---|
| 52 |   void UnvisitedNode(molecule *Mol, atom *&Walker, atom *&OtherAtom, bond *&Binder, bond *&Bond);
 | 
|---|
| 53 |   void VisitedNode(molecule *Mol, atom *&Walker, atom *&OtherAtom, bond *&Binder, bond *&Bond);
 | 
|---|
| 54 | 
 | 
|---|
| 55 |   /** initialise vertex as white with no predecessor, empty queue, color Root lightgray.
 | 
|---|
| 56 |    *
 | 
|---|
| 57 |    */
 | 
|---|
| 58 |   void InitNode(atomId_t atom_id);
 | 
|---|
| 59 | 
 | 
|---|
| 60 |   std::map<atomId_t, atom *> PredecessorList;
 | 
|---|
| 61 |   std::map<atomId_t, int > ShortestPathList;
 | 
|---|
| 62 |   std::map<atomId_t, enum GraphEdge::Shading> ColorList;
 | 
|---|
| 63 |   std::deque<atom *> BFSStack;
 | 
|---|
| 64 |   int BondOrder;
 | 
|---|
| 65 |   atom *Root;
 | 
|---|
| 66 | 
 | 
|---|
| 67 |   bool BackStepping;
 | 
|---|
| 68 |   int CurrentGraphNr;
 | 
|---|
| 69 |   int ComponentNr;
 | 
|---|
| 70 |   std::map<atomId_t, atom *> AddedAtomList;
 | 
|---|
| 71 |   std::map<int, bond *> AddedBondList;
 | 
|---|
| 72 | 
 | 
|---|
| 73 |   bool IsAngstroem;
 | 
|---|
| 74 | };
 | 
|---|
| 75 | 
 | 
|---|
| 76 | 
 | 
|---|
| 77 | #endif /* BREADTHFIRSTSEARCHADD_HPP_ */
 | 
|---|