AStarBondOrderStrategy.h

Go to the documentation of this file.

#ifndef BALL_STRUCTURE_BONDORDERS_ASTARBONDORDERSTRATEGY_H
#define BALL_STRUCTURE_BONDORDERS_ASTARBONDORDERSTRATEGY_H
 
#ifndef BALL_STRUCTURE_BONDORDERS_BONDORDERASSIGNMENTSTRATEGY_H
# include <BALL/STRUCTURE/BONDORDERS/bondOrderAssignmentStrategy.h>
#endif
 
#ifndef BALL_STRUCTURE_BONDORDERS_PARTIALBONDORDERASSIGNMENT_H
# include <BALL/STRUCTURE/BONDORDERS/partialBondOrderAssignment.h>
#endif
 
#ifndef BALL_STRUCTURE_BONDORDERS_BONDORDERASSIGNMENT_H
# include <BALL/STRUCTURE/BONDORDERS/bondOrderAssignment.h>
#endif
 
#ifndef BALL_DATATYPE_HASHMAP_H
# include <BALL/DATATYPE/hashMap.h>
#endif
 
#include <queue>
 
namespace BALL
{
  class AStarBondOrderStrategy
    : public BondOrderAssignmentStrategy
  {
    public:
      struct BALL_EXPORT Option
      {
        static const char* HEURISTIC;
      };
 
      struct BALL_EXPORT Default
      {
        static const String HEURISTIC;
      };
 
      struct BALL_EXPORT Heuristic
      {
        static const String SIMPLE;
        static const String MEDIUM;
        static const String TIGHT;
      };
 
      AStarBondOrderStrategy(AssignBondOrderProcessor* parent);
 
      virtual ~AStarBondOrderStrategy();
 
      virtual void clear();
      virtual void init();
 
      virtual bool readOptions(const Options& options);
      virtual void setDefaultOptions();
 
      virtual boost::shared_ptr<BondOrderAssignment> computeNextSolution();
 
    protected:
 
 
 
      PartialBondOrderAssignment::HEURISTIC_INDEX heuristic_index_;
 
      std::priority_queue<PartialBondOrderAssignment> queue_;
 
      // The current number of node expansions. 
      // step_ + queue_.size() gives the number of touched nodes.
      int step_;
  };
 
}
#endif // BALL_STRUCTURE_BONDORDERS_ASTARBONDORDERSTRATEGY_H