{"library":"passagemath-tdlib","title":"passagemath-tdlib","description":"A Python wrapper for the tdlib library for tree decomposition computations. Provides high-performance tree decomposition algorithms including heuristics, exact methods, and dynamic programming FPT algorithms. Version 10.8.4, part of the passagemath ecosystem.","language":"python","status":"active","last_verified":"Sat May 09","install":{"commands":["pip install passagemath-tdlib"],"cli":null},"imports":["from passagemath.tdlib.tree_decomposition import TreeDecomposition","from passagemath.tdlib.tdlib import tdlib_heuristic_decomposition"],"auth":{"required":false,"env_vars":[]},"quickstart":{"code":"from passagemath.graphs.graph import Graph\nfrom passagemath.tdlib.tree_decomposition import TreeDecomposition\n\n# Create a simple graph (3-cycle)\nG = Graph([(0,1), (1,2), (2,0)])\n\n# Compute a tree decomposition using a heuristic\ntd = TreeDecomposition(G, algorithm='tdlib_heuristic')\nprint(td)\nprint(td.width())","lang":"python","description":"Basic usage: create a graph and compute a tree decomposition via tdlib heuristic.","tag":null,"tag_description":null,"last_tested":null,"results":[]},"compatibility":null}