| Cdelphos::Arc | A class that abstracts a relation between two indexes that represent two block ids | 
| ▼Cdelphos::BlockFilter | Abstracts functions to do block selection | 
| ▼Cdelphos::AccessibilityFilter | Abstracts accessibility filter function | 
| Cdelphos::AccessibilityAndRangeFilter | Abstracts the intersection of an Accessibility and a Range filter function | 
| ▼Cdelphos::AxisRangeFilter | Abstracts range filter function for axis | 
| ▼Cdelphos::RangeFilter | Abstracts range filter function | 
| Cdelphos::AccessibilityAndRangeFilter | Abstracts the intersection of an Accessibility and a Range filter function | 
| Cdelphos::BlockModel | Abstracts a container of blocks as a table with arbitrary number of attributes that can be accessed by index \((0, 1,\ldots, N-1)\) (where \(N\) is total number of blocks) or coordinates \((x,y,z)\) | 
| ▼Cdelphos::BlockModelEntity | A base class for object associated to a given block model | 
| Cdelphos::Block | A utility class to access blocks individually | 
| Cdelphos::BlockSelection | Abstracts a set of blocks (subset of a blockmodel) | 
| Cdelphos::FinalPitInstance | Defines a case for the final pit problem | 
| ▼Cdelphos::FinalPitSolver | A dummy class that specifies the methods of an algorithm that can solve a final pit instance | 
| Cdelphos::PseudoFlowFinalPitSolver | An implementation of a final pit solver based on the Pseudoflow algorithm | 
| Cdelphos::FractionalSchedule | Defines a fractional scheduling of blocks | 
| ▼Cdelphos::FractionalScheduler | Dummy class that define required methods for a solver of a scheduling instance | 
| ▼Cdelphos::BZ | Dummy class that define required methods for a Bienstock Zuckerberg solver of a scheduling instance | 
| Cdelphos::CBCBZ | A fractional Scheduler class based on Bienstock-Zuckerberg algorithm and CBC for solving its sub problems. this scheduler computes at each iteration a final pit and solve the lp relaxation of the original problem | 
| Cdelphos::GurobiBZ | A fractional Scheduler class based on Bienstock-Zuckerberg algorithm and Gurobi for solving its sub problems. this scheduler computes at each iteration a final pit and solve the lp relaxation of the original problem | 
| Cdelphos::CBCFractionalScheduler | Abstracts a CBC LP solver that can solve a scheduling instance | 
| Cdelphos::GurobiFractionalScheduler | Abstracts a Gurobi LP solver that can solve a scheduling instance | 
| Cdelphos::NestedPitInstance | Defines a case for the nested pits problem | 
| ▼Cdelphos::NestedPitSolver | A dummy class that specifies the methods of an algorithm that can solve a nested pit instance | 
| Cdelphos::PseudoFlowNestedPitSolver | An implementation of a nested pit solver based on the Pseudoflow algorithm | 
| ▼Cdelphos::Precedence | Implements a precedence as an explicit set of arcs between blocks. Provides utility functions | 
| Cdelphos::BenchByBenchPrecedence | Defines maximum difference in height between consecutive benches on the same phase | 
| Cdelphos::BenchPhaseDifferencePrecedence | Defines maximum difference in height between consecutive phase-bench | 
| Cdelphos::RampPrecedence | Horizontal precedence class with utility methods | 
| Cdelphos::SlopePrecedence | Vertical precedence class with utility methods for constant slope precedences | 
| ▼Cdelphos::Reblocker | Abstract class to define methods for the reblocking utility | 
| Cdelphos::RegularReblocker | An implementation of a reblocker based on regular dimensions and attribute filters | 
| Cdelphos::Schedule | Defines a scheduling of blocks | 
| ▼Cdelphos::Scheduler | Dummy class that define required methods for a solver of a scheduling instance | 
| ▼Cdelphos::MIPScheduler | Dummy class that define required methods for a MIP solver of a scheduling instance | 
| Cdelphos::CBCMIPScheduler | Abstracts a CBC MIP solver that can solve a scheduling instance | 
| Cdelphos::GurobiMIPScheduler | Abstracts a Gurobi MIP solver that can solve a scheduling instance | 
| ▼Cdelphos::SchedulingHeuristic | Dummy class that define required methods for a heuristic that solve a scheduling instance | 
| Cdelphos::BZHeuristic | Class that defines heuristics that use expected times for blocks, computed by Bienstock Zuckerberg algorithm (BZ) | 
| ▼Cdelphos::FractionalScheduleToSchedule | Dummy class that define required methods for a fractional schedule to schedule heuristic that solve a scheduling instance | 
| ▼Cdelphos::RankedFractionalScheduleToSchedule | Dummy class that define required methods for a ranked fractional schedule to schedule heuristic that solve a scheduling instance | 
| Cdelphos::TopoHeuristic | Class that defines a modified Topological sort heuristic that solve a scheduling instance. Only PrecedenceConstraint and AttributeSumConstraint are supported. Use of BlockSelection not null in Constraints not implemented. An attempt of considering AttributeAvgConstraint is implemented | 
| Cdelphos::HReb | Class that defines a twos phase Reblocking heuristic that solve a scheduling instance. First phase is a topological aggregation. The second phase is a topoligcal desaggregation that permit to obtain a feasible solution to original problem. This implementation of the heuristic is not working for a model that got multi fractional destination variables. If the scheduling instance has got the PCPSP flag on, an exception is thrown. This implementation of the heuristic is working only for a simple slope precedence. RampPrecedenceConstaint, sinking constraints, GeometricConstraint and BlockSelectionPrecedenceConstraint not implemented. Use of BlockSelection not null in all Constraints not implemented | 
| ▼Cdelphos::SlidingTimeWindowHeuristic | Class that defines sliding time window heuristic that solve a scheduling instance | 
| ▼Cdelphos::SlidingTimeWindowHeuristicRelaxed | Class that defines relaxed sliding time window heuristic that solve a scheduling instance | 
| Cdelphos::NewmanHeuristic | Class that defines a sliding time window heuristic with lagrangean relaxion that solve a scheduling instance | 
| Cdelphos::SchedulingInstance | Defines a scheduling instance to be solved | 
| Cdelphos::Coordinates | An utility class to abstract coordinates so they can be used as map and set keys by means of string conversion | 
| Cdelphos::coordindex | Structure to store index coordinates for a block | 
| ▼Cdelphos::Dict | Abstact a dictionary to store and get attributes | 
| Cdelphos::Stock | Defines a pre-existing stock | 
| ▼Cstd::exception | STL class | 
| Cdelphos::MineLinkException | Abstracts Exceptions for MineLink library. In Windows, Log File MineLink.log is gererally for a user_name user in "C:\\Users\\user_name\\AppData\\Local\\Temp" accessible from console | 
| Cdelphos::MinCutGraph | An implementation of the graph used by the final pit solver based on the Pseudoflow algorithm to solve the min-cut problem | 
| ▼CNamed |  | 
| Cdelphos::Ccol | Abstracts a container of computed column | 
| ▼Cdelphos::Constraint | Defines the base class for all constraints | 
| ▼Cdelphos::BlockConstraint | A base class for constraints that apply to subsets of blocks | 
| ▼Cdelphos::BlockTimingConstraint | Defines a constraint that limits processing periods or destinations for blocks | 
| ▼Cdelphos::AttributeSumConstraint | A constraint on the addition of the attributes of a block | 
| Cdelphos::AttributeAvgConstraint | A constraint on the average values of attributes of blocks | 
| Cdelphos::DoNotMineBeforeConstraint | A constraint limiting the period at which a block should be mined | 
| Cdelphos::ForceMiningByConstraint | A constraint that forces a block to be mined before or at some period | 
| Cdelphos::DoNotSendToConstraint | A constraint that prevents certain blocks to be sent to given processes | 
| Cdelphos::MinExtractPeriodConstraint | A constraint that prevents certain blocks that can't be extracted before a period due to capacities constraints, to be used | 
| Cdelphos::BlockSelectionPrecedenceConstraint | A block selection precedence constraint | 
| ▼Cdelphos::PrecedenceConstraint | A precedence constraint | 
| Cdelphos::GeometricConstraint | A geometric constraint | 
| ▼Cdelphos::TimedConstraint | A base class for constraints indexed by time-period | 
| Cdelphos::BlockTimingConstraint | Defines a constraint that limits processing periods or destinations for blocks | 
| Cdelphos::Destination | Defines a destination or process | 
| Cdelphos::Stock | Defines a pre-existing stock | 
| Cdelphos::NestedPits | Defines nested pits | 
| Cdelphos::relcoordindex | Structure to store index coordinates for a block | 
| Cdelphos::RosettaSlope | This class allows to store different slope angles depending on azimuth | 
| ▼Cdelphos::SelectionFunctor | Abstract class that defines the basis for classes that abstracts functions to perform selections | 
| Cdelphos::SelectionMajor | Abstracts a function to perform statistical mode | 
| Cdelphos::SelectionMax | Abstracts the maximum function to be evaluated over a set of blocks | 
| Cdelphos::SelectionMin | Abstracts the minimum function to be evaluated over a set of blocks | 
| ▼Cdelphos::SelectionSum | Abstracts a sum function to be evaluated over a set of blocks | 
| Cdelphos::SelectionAvg | Abstracts average-type functions to be evaluated over a set of blocks | 
| Cdelphos::SlopeDefinition | This class defines a slope precedence |