{"id":35264113,"url":"https://github.com/arcuru/dlx-cpp","last_synced_at":"2026-05-20T19:43:20.177Z","repository":{"id":137513592,"uuid":"65867095","full_name":"arcuru/dlx-cpp","owner":"arcuru","description":"A couple implementations of Knuth's Algorithm X, AKA Dancing Links.","archived":false,"fork":false,"pushed_at":"2024-12-19T19:45:30.000Z","size":19,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2026-01-12T14:19:35.154Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"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/arcuru.png","metadata":{"files":{"readme":"README.md","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,"governance":null}},"created_at":"2016-08-17T01:49:52.000Z","updated_at":"2024-12-19T19:45:33.000Z","dependencies_parsed_at":null,"dependency_job_id":"5a7e1cfc-319b-4bc7-8f67-1bfcb3623d96","html_url":"https://github.com/arcuru/dlx-cpp","commit_stats":null,"previous_names":["arcuru/dlx-cpp"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/arcuru/dlx-cpp","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arcuru%2Fdlx-cpp","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arcuru%2Fdlx-cpp/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arcuru%2Fdlx-cpp/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arcuru%2Fdlx-cpp/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/arcuru","download_url":"https://codeload.github.com/arcuru/dlx-cpp/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arcuru%2Fdlx-cpp/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33272901,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-20T15:12:43.734Z","status":"ssl_error","status_checked_at":"2026-05-20T15:12:42.300Z","response_time":356,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":"2025-12-30T09:48:08.772Z","updated_at":"2026-05-20T19:43:20.172Z","avatar_url":"https://github.com/arcuru.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"#dlx - cpp\nA couple implementations of Knuth's Algorithm X, AKA Dancing Links.\n\nAlgorithm X is useful for solving [exact cover](https://en.wikipedia.org/wiki/Exact_cover) problems. The most well-known examples are probably N-Queens and Sudoku.\n\n[Knuth's Algorithm X](https://en.wikipedia.org/wiki/Knuth%27s_Algorithm_X) is an algorithm for efficiently solving the exact cover problem. Dancing Links (or DLX) specifically refers to a particular implementation involving a doubly-linked torus.\n\nFor details of the algorithm see wikipedia or [Donald Knuth's original paper](https://www.ocf.berkeley.edu/~jchu/publicportal/sudoku/0011047.pdf).\n\n#Details\n\nThis library contains 2 separate implementations of Algorithm X.\n\n1. **DLX** - Defined in dlx.h. A clean implementation of Dancing Links.\n2. **DLX_Containers** - Defined in dlx_containers.h. Uses stdlib containers to get the same functionality of DLX without any pointers.\n\nBoth have identical interfaces, but **DLX** is 3-4x more efficient at the moment. There is essentially no reason to use DLX_Containers in production, but it can be useful to read through if you'd like to understand the algorithm.\n\n#Examples\n\nSee test/nqueens.cpp for an example of using the library to solve the N-Queens problem\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Farcuru%2Fdlx-cpp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Farcuru%2Fdlx-cpp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Farcuru%2Fdlx-cpp/lists"}