{"library":"planarity","title":"Planarity - Graph Planarity Tools","description":"Planarity is a Python package for testing and manipulating the planarity of undirected graphs. It wraps the Boyer-Myrvold planarity algorithm (C library) and provides functions like is_planar, kuratowski_subgraph, and planar_embedding. The current version is 0.6, released with Cython 3 support, but the library is in maintenance mode with infrequent updates.","language":"python","status":"maintenance","last_verified":"Fri May 01","install":{"commands":["pip install planarity"],"cli":null},"imports":["import planarity"],"auth":{"required":false,"env_vars":[]},"quickstart":{"code":"import planarity\n\ndef test_planarity():\n    # Example: complete graph K5 is non-planar\n    edges = [(0, 1), (0, 2), (0, 3), (0, 4),\n             (1, 2), (1, 3), (1, 4),\n             (2, 3), (2, 4),\n             (3, 4)]\n    # Check planarity\n    result = planarity.is_planar(edges)\n    print('Is K5 planar?', result)  # False\n\ntest_planarity()","lang":"python","description":"Simple test of planarity for the non-planar graph K5.","tag":null,"tag_description":null,"last_tested":null,"results":[]},"compatibility":null}