didppy.Solution

class didppy.Solution

Solution returned by a heuristic search solver.

Methods

Attributes

best_bound

Best dual bound.

cost

Solution cost.

expanded

Number of expanded nodes.

generated

Number of generated nodes.

is_infeasible

If the problem is infeasible or not.

is_optimal

If the solution is optimal or not.

time

Elapsed time in seconds.

time_out

Whether to exceed the time limit.

transitions

Sequence of transitions corresponding to the solution

best_bound

Best dual bound. None if the solver does not compute a dual bound.

Type:

int, float, or None

cost

Solution cost. None if a solution is not found.

Type:

int, float, or None

expanded

Number of expanded nodes.

Type:

int

generated

Number of generated nodes.

Type:

int

is_infeasible

If the problem is infeasible or not.

Type:

bool

is_optimal

If the solution is optimal or not.

Type:

bool

time

Elapsed time in seconds.

Type:

float

time_out

Whether to exceed the time limit.

Type:

bool

transitions

Sequence of transitions corresponding to the solution

Type:

list of Transition