{"categories":[{"label":"Libraries","url":"https://skillfed.io/packages/category/software-development-libraries/5"},{"label":"Scientific/Engineering","url":"https://skillfed.io/packages/category/scientific-engineering/3"},{"label":"Python Modules","url":"https://skillfed.io/packages/category/software-development-libraries-python-modules/9"},{"label":"Artificial Intelligence","url":"https://skillfed.io/packages/category/scientific-engineering-artificial-intelligence/4"},{"label":"Information Analysis","url":"https://skillfed.io/packages/category/scientific-engineering-information-analysis/2"},{"label":"Mathematics","url":"https://skillfed.io/packages/category/scientific-engineering-mathematics/2"},{"label":"Visualization","url":"https://skillfed.io/packages/category/scientific-engineering-visualization"},{"label":"Bio-Informatics","url":"https://skillfed.io/packages/category/scientific-engineering-bio-informatics"},{"label":"Physics","url":"https://skillfed.io/packages/category/scientific-engineering-physics"},{"label":"Chemistry","url":"https://skillfed.io/packages/category/scientific-engineering-chemistry"},{"label":"Electronic Design Automation (EDA)","url":"https://skillfed.io/packages/category/scientific-engineering-electronic-design-automation-eda"}],"enrichment":{"capability":"Tests whether a graph is planar, computes planar embeddings, draws planar graphs as ASCII art, and isolates forbidden subgraphs using algorithms from the Edge Addition Planarity Suite.","skillfed_tags":["graph-algorithms","planar-graphs","computational-geometry"],"use_cases":["Verify whether a network topology or circuit diagram can be drawn without edge crossings before layout algorithms.","Detect and isolate forbidden subgraphs (like K5 or K3,3) in graph-based data structures for constraint checking.","Generate quick ASCII visualizations of small planar graphs for debugging or documentation.","Integrate planar graph testing into NetworkX-based graph analysis pipelines.","Benchmark or validate planar graph algorithms in academic research or algorithm development."],"what_it_does":"Planarity is a Python wrapper around the Edge Addition Planarity Suite (EAPS), a high-performance C library for planar graph algorithms. It provides functions to test whether a graph is planar, compute planar embeddings, generate ASCII-art drawings of planar graphs, and detect forbidden subgraphs. The package has no runtime dependencies and is designed for developers and researchers working with graph theory, discrete mathematics, and algorithm development.\n\nThe package accepts graphs as edge lists (tuples of vertex labels) and returns results as booleans, dictionaries, or formatted strings. It is production-stable (Development Status 5) and actively maintained, with support for modern Python versions (3.10\u20133.14). However, installation requires compilation from source, which adds friction on platforms without a C compiler readily available.","worth_installing":"Yes, if you need planar graph algorithms and can handle compilation. The package is stable, actively maintained, permissively licensed, and has no runtime dependencies. High install friction (source compilation required) is the main drawback; verify your build environment supports C compilation before installing. No known security vulnerabilities."},"id":"planarity","links":{"html":"https://skillfed.io/packages/planarity","md":"https://skillfed.io/packages/planarity.md","pypi":"https://pypi.org/project/planarity/"},"maintenance":{"status":"active"},"meta":{"latest_release":"2026-06-29","license_spdx":"BSD-3-Clause","license_treatment":"permissive","name":"planarity","python_support":"supports_current","summary":"Python Wrapper for the Edge Addition Planarity Suite and Graph Library"},"popularity":{"monthly_downloads":709596,"position":5262,"tier":"top_15000"},"security":{"n_vulnerabilities":0},"version":"1.0.0"}