minorminer is a heuristic tool for minor embedding: given a minor and target graph, it tries to find a mapping that embeds the minor into the target.
The primary utility function,
`find_embedding()`, is an implementation of the heuristic algorithm described in . It accepts various optional parameters used to tune the algorithm’s execution or constrain the given problem.
This implementation performs on par with tuned, non-configurable implementations while providing users with hooks to easily use the code as a basic building block in research.