Detailed Description

Set of parameters used to configure how the neighnorhood is traversed.

Definition at line 1303 of file constraint_solveri.h.

Public Attributes
int	number_of_base_nodes
	Number of nodes needed to define a neighbor. More...

bool	skip_locally_optimal_paths
	Skip paths which have been proven locally optimal. More...

bool	accept_path_end_base
	True if path ends should be considered when iterating over neighbors. More...

std::function< int(int64_t)>	start_empty_path_class
	Callback returning an index such that if c1 = start_empty_path_class(StartNode(p1)), c2 = start_empty_path_class(StartNode(p2)), p1 and p2 are path indices, then if c1 == c2, p1 and p2 are equivalent if they are empty. More...

Member Data Documentation

◆ accept_path_end_base

bool accept_path_end_base

True if path ends should be considered when iterating over neighbors.

Definition at line 1310 of file constraint_solveri.h.

◆ number_of_base_nodes

int number_of_base_nodes

Number of nodes needed to define a neighbor.

Definition at line 1305 of file constraint_solveri.h.

◆ skip_locally_optimal_paths

bool skip_locally_optimal_paths

Skip paths which have been proven locally optimal.

Note this might skip neighbors when paths are not independent.

Definition at line 1308 of file constraint_solveri.h.

◆ start_empty_path_class

std::function<int(int64_t)> start_empty_path_class

Callback returning an index such that if c1 = start_empty_path_class(StartNode(p1)), c2 = start_empty_path_class(StartNode(p2)), p1 and p2 are path indices, then if c1 == c2, p1 and p2 are equivalent if they are empty.

This is used to remove neighborhood symmetries on equivalent empty paths; for instance if a node cannot be moved to an empty path, then all moves moving the same node to equivalent empty paths will be skipped. 'start_empty_path_class' can be nullptr in which case no symmetries will be removed.

Definition at line 1321 of file constraint_solveri.h.

The documentation for this struct was generated from the following file: