--- id: minorminer version: "0.2.22" license: unclear license_treatment: unclear maintenance: active --- # minorminer — Heuristic algorithm to find graph minor embeddings. License: unclear · Maintenance: active · Downloads: 98.0K/mo ## What it is and what it does minorminer is a heuristic tool for finding graph minor embeddings—that 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. The 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. Use it for: - 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. ## Worth the install? AI-flagged interpretation of the facts above — verify before relying. minorminer finds graph minor embeddings—it maps one graph into another as a subgraph—using a configurable heuristic algorithm, plus specialized functions for clique and biclique embeddings on quantum-graph topologies. 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–3.14) with precompiled wheels. License treatment is unclear in the metadata—verify the Apache License 2.0 claim before use in proprietary contexts. Medium install friction due to compiled dependencies is typical for scientific Python packages. ## Install pip install minorminer uv add minorminer poetry add minorminer ## Installing minorminer Before you install: Medium install friction: compiled wheels available for Python 3.10–3.14 on macOS, Linux, and Windows, but requires six runtime dependencies including numpy and scipy. Repository is active with a recent release (59 days old) and no known vulnerabilities. License in practice: License treatment is unclear—the description mentions Apache License 2.0 but the metadata lacks formal SPDX or raw license declaration. Verify the actual license terms before use in proprietary or restricted-license contexts. Quickstart: from minorminer import find_embedding triangle = [(0, 1), (1, 2), (2, 0)] square = [(0, 1), (1, 2), (2, 3), (3, 0)] embedding = find_embedding(triangle, square, random_seed=10) print(embedding) Requires Python >=3.10; scipy and numpy must be installed as runtime dependencies. Verify before relying: - Whether the Apache License 2.0 mentioned in the description is the authoritative license for this package. - Performance characteristics and scalability limits for large graphs. - Whether the algorithm guarantees a solution or returns empty when no embedding exists. ## Package facts - License: not declared (unclear) - Python support: supports_current - Install friction: medium - Maintenance: active - Downloads: 98.0K/month (top 15,000 on PyPI) - Known vulnerabilities: none known ## Tags graph minor embedding, find graph embedding algorithm, clique embedding quantum, graph isomorphism mapping, minor embedding heuristic, graph-algorithms, quantum-computing, embedding [View on SkillFed](https://skillfed.io/packages/minorminer) · [View on PyPI](https://pypi.org/project/minorminer/)