topology-sanity-check
OfficialVerify reduction graph integrity.
Software Engineering#graph analysis#code verification#sanity check#reduction rules#NP-hard problems#topology check
AuthorCodingThrust
Version1.0.0
Installs0
System Documentation
What problem does it solve?
This Skill ensures the integrity and correctness of the problem reduction graph by performing automated sanity checks, identifying potential issues like disconnected problems, missing NP-hardness proofs, and redundant reduction rules.
Core Features & Use Cases
- Orphan Detection: Identifies problems that are registered but not connected to the main reduction graph.
- NP-Hardness Verification: Checks if all NP-hard problems have a valid reduction path originating from 3-SAT.
- Redundancy Analysis: Detects if direct reduction rules are made obsolete by more efficient composite paths.
- Use Case: Before publishing new reduction rules, run this Skill to catch any structural flaws or inefficiencies in the graph, ensuring a robust and well-formed knowledge base of NP-hard problems.
Quick Start
Run all topology sanity checks on the reduction graph.
Dependency Matrix
Required Modules
cargo
Components
scriptsreferences
💻 Claude Code Installation
Recommended: Let Claude install automatically. Simply copy and paste the text below to Claude Code.
Please help me install this Skill: Name: topology-sanity-check Download link: https://github.com/CodingThrust/problem-reductions/archive/main.zip#topology-sanity-check Please download this .zip file, extract it, and install it in the .claude/skills/ directory.
Agent Skills Search Helper
Install a tiny helper to your Agent, search and equip skill from 223,000+ vetted skills library on demand.