{"categories":[{"label":"Mathematics","url":"https://skillfed.io/packages/category/scientific-engineering-mathematics/3"}],"enrichment":{"capability":"minorminer finds graph minor embeddings\u2014it maps one graph into another as a subgraph\u2014using a configurable heuristic algorithm, plus specialized functions for clique and biclique embeddings on quantum-graph topologies.","skillfed_tags":["graph-algorithms","quantum-computing","embedding"],"use_cases":["Embed a logical problem graph into a quantum processor's physical topology for quantum annealing.","Find clique embeddings on specialized graph architectures (Chimera, Pegasus, Zephyr) in polynomial time.","Map a minor graph into a target graph for graph theory research or algorithm prototyping.","Constrain or initialize embeddings with fixed or hinted variable assignments for guided search.","Validate graph minor relationships or explore embedding feasibility in academic or experimental settings."],"what_it_does":"minorminer is a heuristic tool for finding graph minor embeddings\u2014that is, mappings that embed one graph (the minor) into another (the target) as a connected subgraph. The core function, find_embedding(), implements a configurable algorithm based on published research and accepts parameters to tune execution or constrain the problem. It performs comparably to non-configurable implementations while exposing hooks for research use.\n\nThe package also provides find_clique_embedding() for polynomial-time clique embeddings on Chimera, Pegasus, and Zephyr graphs (quantum processor topologies), plus utilities for biclique embeddings. It depends on networkx, numpy, scipy, fasteners, homebase, and dwave-graphs, making it suitable for quantum computing workflows, graph algorithm research, and topology-aware problem mapping.","worth_installing":"Yes, if you need graph minor embeddings or clique embeddings on quantum topologies. The package is actively maintained, has no known vulnerabilities, and supports current Python versions (3.10\u20133.14) with precompiled wheels. License treatment is unclear in the metadata\u2014verify the Apache License 2.0 claim before use in proprietary contexts. Medium install friction due to compiled dependencies is typical for scientific Python packages."},"id":"minorminer","links":{"html":"https://skillfed.io/packages/minorminer","md":"https://skillfed.io/packages/minorminer.md","pypi":"https://pypi.org/project/minorminer/"},"maintenance":{"status":"active"},"meta":{"latest_release":"2026-06-16","license_spdx":null,"license_treatment":"unclear","name":"minorminer","python_support":"supports_current","summary":"Heuristic algorithm to find graph minor embeddings."},"popularity":{"monthly_downloads":98037,"position":13112,"tier":"top_15000"},"security":{"n_vulnerabilities":0},"version":"0.2.22"}