{"id":19649513,"url":"https://github.com/gregable/pq-trees","last_synced_at":"2025-11-02T15:04:29.081Z","repository":{"id":433904,"uuid":"54674","full_name":"Gregable/pq-trees","owner":"Gregable","description":"General implementation of the PQ Tree algorithm.","archived":false,"fork":false,"pushed_at":"2011-03-06T20:39:22.000Z","size":361,"stargazers_count":29,"open_issues_count":1,"forks_count":7,"subscribers_count":5,"default_branch":"master","last_synced_at":"2025-07-17T09:52:56.547Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"http://gregable.com/2008/11/pq-tree-algorithm-and-consecutive-ones.html","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Gregable.png","metadata":{"files":{"readme":"README","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2008-09-20T18:42:17.000Z","updated_at":"2025-04-13T14:10:40.000Z","dependencies_parsed_at":"2022-08-16T10:25:14.932Z","dependency_job_id":null,"html_url":"https://github.com/Gregable/pq-trees","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Gregable/pq-trees","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gregable%2Fpq-trees","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gregable%2Fpq-trees/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gregable%2Fpq-trees/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gregable%2Fpq-trees/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Gregable","download_url":"https://codeload.github.com/Gregable/pq-trees/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gregable%2Fpq-trees/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":282306008,"owners_count":26647755,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-11-02T02:00:06.609Z","response_time":64,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-11-11T14:54:44.961Z","updated_at":"2025-11-02T15:04:29.066Z","avatar_url":"https://github.com/Gregable.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"A C++ implementation of Booth \u0026 Lueker's PQ-Tree algorithm.\n\nKellog S. Booth, George S. Lueker, Testing for the consecutive ones property,\ninterval graphs, and graph planarity using PQ-tree algorithms, Journal of\nComputer and Systems Sciences, 13(3) (1976) 335-379.\n\nIMPORTANT NOTE: This code currently is known to be buggy on some rare inputs.  A believed to be correct, but harder to use version of this code can be found as a library within BiVoC: https://bioinformatics.cs.vt.edu/~murali/papers/bivoc/\n\nDescription of files:\nThe main file for this library is pqtree.h.  It contains an API that can be\nused by client code for dealing with PQ-Trees.  There are two binaries:\nfuzztest and pqtest.\n\npqtest runs the pqtree code for one example set of reductions on a single tree, printing the state of the tree at every step.  This illustrates how the pqtree is built.\n\nfuzztest generates a large random set of possible reductions and runs them\nagainst the library making sure that it never returns false or segfaults.\n\nUsage:\nPrimarily, this is intended to be used as a library, not a binary.  But you can\nstill compile and run the binaries |pqtest| and |fuzztest|.  My personal\nrecommendation would be to compile with scons, http://scons.org/.  To do so,\nrun:\n\n$ scons\n$ ./fuzztest\n$ ./pqtest\n\nAlternatively, I also handily include the tried and true MakeFile, so if you\ndon't have scons on your system and don't feel like installing it, instead just\nrun:\n\n$ make\n$ ./fuzztest\n$ ./pqtest\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgregable%2Fpq-trees","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgregable%2Fpq-trees","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgregable%2Fpq-trees/lists"}