Module dogs::search_space [−][src]
Expand description
Various search space related traits (SearchSpace, GuidedSpace, etc.)
Traits
Represents a search space which there exists a bound on the distance between the root node and any node. This kind of property is frequent in combinatorial branch-and-bounds.
Defines a guidance function
Allows to identify a node. Useful to implement g-cost-dominance / bucket-lists or tabu-search
Represents a search space where nodes can pareto-dominate some other. i.e. a node dominantes another if all of its features are better
implements a partial neighbor expansion (next_neighbor)
Defines a search space. A search space is a graph structure (directed or not). It contains nodes. The initial state is the entry point of the search procedure.
exports a node to a problem solution Sol.
implements a total neighbor expansion (neighbors)