MineLink
 All Data Structures Functions Variables Pages
pseudoflowfp.h
1 #ifndef __PSEUDOFLOW2_H__
2 #define __PSEUDOFLOW2_H__
3 
4 #include <ctime>
5 #include <cstdlib>
6 #include <iostream>
7 #include <limits>
8 #include <cstring>
9 #include <fstream>
10 #include "../../problems/finalpit/fp.h"
11 #include "graph.h"
12 
13 #ifdef SPTR
14 #include "smallptr.h"
15 #endif
16 
17 using namespace std;
18 namespace delphos{
30 private:
31  bool _solved;
32  MinCutGraph* _graph;
33  double _finalpit_value;
34 
35 
36 
37  /*void CreateArcs(
38  const double & angle_degrees,
39  const unsigned int & levels,
40  const double & dx,
41  const double & dy,
42  const double & dz,
43  const unsigned int numnodes,
44  Node *adjacencylist,
45  vector<FlowArc>& arclist) const;*/
46 
47 
48  //unsigned int _default_nblevel;
49  //double _default_ang;
50 
51 public:
58 
66  PseudoFlowFinalPitSolver(const FinalPitInstance & fp,const double& ang,const unsigned int& nblevel);
67 
71  virtual ~PseudoFlowFinalPitSolver();
72 
78  virtual bool Run();
79 
85  virtual delphos::BlockSelection* FinalPit();
86 
92  virtual delphos::BlockSelection* GetFinalPit();
93 
99  virtual double PitValue();
100 
106  virtual double GetPitValue();
107 
113  virtual const bool IsSolved() const;
114 };
115 }
116 
117 #endif
118 
Abstracts a set of blocks (subset of a blockmodel).
Definition: blocksel.h:33
Defines a case for the final pit problem.
Definition: fp.h:21
An implementation of the graph used by the final pit solver based on the Pseudoflow algorithm to solv...
Definition: graph.h:18
A dummy class that specifies the methods of an algorithm that can solve a final pit instance...
Definition: fp.h:57
An implementation of a final pit solver based on the Pseudoflow algorithm.
Definition: pseudoflowfp.h:29