{"_id":"@tscircuit/hypergraph","_rev":"73-0222b0f284235f8cce7dcb984db67da4","name":"@tscircuit/hypergraph","dist-tags":{"latest":"0.0.73"},"versions":{"0.0.1":{"name":"@tscircuit/hypergraph","version":"0.0.1","_id":"@tscircuit/hypergraph@0.0.1","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"31a4759149f96e70c3254ca17a89b2d4c3756e5d","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.1.tgz","fileCount":5,"integrity":"sha512-aeH2D4MrrBtMbs2FlDBYhJF+9I88a8TrKGlHuj06DTO8k6Jxr52QdRCPucXQOM9h7nZV7+5dg2EYy5gR+arK8w==","signatures":[{"sig":"MEUCIQCFJFlnwKt5JehteO0qz9owYK6qyPC3j7ij3LS0O9j2LwIgTzPAMT7dSRXdHC+QMlPFDmpVyCAU7HxPAsF+uOQU0sY=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":92293},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"f4520742b395adc91755ff7e88cb2efc57e03486","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","build:site":"cosmos-export"},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.1","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"22.3.0","dependencies":{"@tscircuit/solver-utils":"^0.0.13"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.76","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.1_1767740931105_0.43115157226887413","host":"s3://npm-registry-packages-npm-production"}},"0.0.2":{"name":"@tscircuit/hypergraph","version":"0.0.2","_id":"@tscircuit/hypergraph@0.0.2","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"6efc0778796095cd518473d04f2c2a2a1c824d98","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.2.tgz","fileCount":5,"integrity":"sha512-2msI7nJatK11vFNdOb2GnnXZBRpNfmtwDTU2Jtc6V/ouxwlB26h5U7YYdwnqKN8QXP+s7TvwOtkll7gEfcH/hA==","signatures":[{"sig":"MEQCIGJCh4lUGk3uLOXP9XVzv1W0ssIhg30BKzytdJ5UTpksAiBszFFPwexIqzylHAvA4MDBw24cTdmyXnzaa1TjH8xVeg==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":92293},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"8efad0929d3225b58a5ec70dd63beab2f9e97192","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","build:site":"cosmos-export"},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.19.6","dependencies":{"@tscircuit/solver-utils":"^0.0.13"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.76","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.2_1767741016116_0.5052322539683862","host":"s3://npm-registry-packages-npm-production"}},"0.0.3":{"name":"@tscircuit/hypergraph","version":"0.0.3","_id":"@tscircuit/hypergraph@0.0.3","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"54afcd4441d587f69f51743fa68536200f0221d1","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.3.tgz","fileCount":5,"integrity":"sha512-KaauA3jxoqmrD09TShXUqbIHenWqtUuT8O/K56XPESWKjuCcdAlq6iAHsGkBUfd81kWUidVWLOQzlqOWvQmKmA==","signatures":[{"sig":"MEYCIQDT+usNRtNawHos7g23g52bR/t4mwe3G8WsPu1Ew9xsBwIhANJvGgy75uYxul6HJziYCBhP8Rw8oe1Oh4ZCOUS1kuR9","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":93540},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"78d27b8afd23803d88c08b7e21b6383c205b1f0c","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","build:site":"cosmos-export"},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.19.6","dependencies":{"@tscircuit/solver-utils":"^0.0.13"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.76","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.3_1767757146080_0.7902163713536718","host":"s3://npm-registry-packages-npm-production"}},"0.0.4":{"name":"@tscircuit/hypergraph","version":"0.0.4","_id":"@tscircuit/hypergraph@0.0.4","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"161a7ab84eddfe7b0bbccf67c6cd23ff0c0473da","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.4.tgz","fileCount":5,"integrity":"sha512-Ri5/VBhtgKlE7fJjrPNmGYh1kxBrS+wm60+JD6E60oSXKWAcccqRei5K1HZUWXtKeeD58uHvEFJr03f7q1sDiA==","signatures":[{"sig":"MEYCIQCBYdLqEgZSM4NSMJ9I5eU+PCia0sPp4a2xUcziPZZD0gIhAIKd20BYnHMIrrpiOBo++owhk2ksen5wAg57/9zjMC+z","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":94519},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"b2151afc1a49ec8e44bf5736c0de341892285f24","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export"},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.19.6","dependencies":{"@tscircuit/solver-utils":"^0.0.13"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.76","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.4_1767809651376_0.38053850664388533","host":"s3://npm-registry-packages-npm-production"}},"0.0.5":{"name":"@tscircuit/hypergraph","version":"0.0.5","_id":"@tscircuit/hypergraph@0.0.5","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"65009f78920882d1888e2d8c31eac1c94597c091","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.5.tgz","fileCount":5,"integrity":"sha512-aujt5JVaDhSASuTeFCiOTYiDbzqJuQ0En7m77Hsn04BHjezT6plgc8pMnpGHvUoienRDEXyTGNVsAPumis0J4A==","signatures":[{"sig":"MEUCIGai57jKGMhjSAL6DQ6ULSJrVG5BDR9xIvYaSBnQZ663AiEArhTO5f+dRDyEbmb6f4aq2NqEMP06hNzFOHr3ePJNid8=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":96080},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"96de0009293630f4e8515ca5f67e43ea46d7a71a","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.19.6","dependencies":{"@tscircuit/solver-utils":"^0.0.13"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.76","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.5_1767817270236_0.31887774734717045","host":"s3://npm-registry-packages-npm-production"}},"0.0.6":{"name":"@tscircuit/hypergraph","version":"0.0.6","_id":"@tscircuit/hypergraph@0.0.6","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"f4a648dc9795c434b5981af22eb96f0d12712332","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.6.tgz","fileCount":5,"integrity":"sha512-IO9G6iHe+iKhIljrbj2zAcrKswu2vh3OBM1h7YjDxuDpS+CQQOGwx0SVXS1TLzMuqnlbwJoeljY59Dl6hO3sgQ==","signatures":[{"sig":"MEUCIQCaExGMYdtUYPzuqINRHDHb3ql4/By136uLGyP7XrzcHQIgUnEeOW7EiU/JpodODe1xWyj1Q5eyw+xoCHm6L3/LQ0E=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":96492},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"6711e9d476421549af6680824ef9c00da82fa48f","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.19.6","dependencies":{"@tscircuit/solver-utils":"^0.0.13"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.76","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.6_1767828868883_0.4029756575375014","host":"s3://npm-registry-packages-npm-production"}},"0.0.7":{"name":"@tscircuit/hypergraph","version":"0.0.7","_id":"@tscircuit/hypergraph@0.0.7","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"fb100d73b931de652abf3ef452260bbfbb2742b4","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.7.tgz","fileCount":5,"integrity":"sha512-ZntmZjE6TbyAxOLqm6ftufDoRcBX7EYcvnPo9CNF34iGD+yXgyIZJAfc6usqQnMUopzYEy51OKPfPotQpXhf6w==","signatures":[{"sig":"MEUCIEIucVduFcJkinrlaanLuwdMgb1kRbpcGJrZOmn7Z7fKAiEAmwV0bN71YvlA/N0u1fYdNdc50fwUP6L1oTi7GZUWDzg=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":96536},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"75bce5f7b7dd0c56f2ef091c39a860d47d42233d","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.19.6","dependencies":{"@tscircuit/solver-utils":"^0.0.13"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.76","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.7_1767829018889_0.9276710232394412","host":"s3://npm-registry-packages-npm-production"}},"0.0.8":{"name":"@tscircuit/hypergraph","version":"0.0.8","_id":"@tscircuit/hypergraph@0.0.8","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"4fd87b6d754a644ff173db116e974e0ce98c6bb4","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.8.tgz","fileCount":5,"integrity":"sha512-9oZXmxcpy1ENBuz73KMc+hFM5oMd4wr58zPUsLlZdDMf5k+0c+s/IGVP4te/OHA53CKjcwePCezG1/i0d3Tfrg==","signatures":[{"sig":"MEYCIQDo0NW9YWxsvthL+N3pO7pvPoWCmmkBYLI5O+3uZU2JwAIhALFbbdCUZvEmX5v9Z4rldiu6RgzARIGYYKj9FuNT3Evh","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":96956},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"7cbac8e06140cb0f156d4ef12fc281f4d5c7e931","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.19.6","dependencies":{"@tscircuit/solver-utils":"^0.0.13"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.76","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.8_1767835633139_0.10582671247256625","host":"s3://npm-registry-packages-npm-production"}},"0.0.9":{"name":"@tscircuit/hypergraph","version":"0.0.9","_id":"@tscircuit/hypergraph@0.0.9","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"613fb14199646fe691a6bf9f8a3dbbee0443a2ab","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.9.tgz","fileCount":5,"integrity":"sha512-BPTiYcPOCG0mYllrqJuBwyc4req6IZxwmE8CjufD8ELNK6BpovDFkgtACWuKYn/0AEcb6Qmnc1UP2N24c4r9/Q==","signatures":[{"sig":"MEUCID7+KwzWLq0KzEkRTXm/CKJkhVgNMTGIto+Cwtr3fTY5AiEA0cX0d5ko0o4imDs+Qt4SLwTtZpRlSfFh9JsFZVWZNao=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":96956},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"9ad9bbb557c467c85fc129f6fb4d04311f15eb58","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.19.6","dependencies":{"@tscircuit/solver-utils":"^0.0.13"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.76","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.9_1767852842864_0.3051555874987224","host":"s3://npm-registry-packages-npm-production"}},"0.0.10":{"name":"@tscircuit/hypergraph","version":"0.0.10","_id":"@tscircuit/hypergraph@0.0.10","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"76a7c404d1426d86eca07606baac0f827bf3a65d","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.10.tgz","fileCount":5,"integrity":"sha512-rk4CkHgC52EXmhvdFB7uM0wWejn4BcrDC2eQHKImS/3pUl5K83CpNgOGkx4O6cqX2lqyKHqKKvQBDYDG4gTeHA==","signatures":[{"sig":"MEQCICi7Z9qjKwAG7algVdCaeHyzW6fVft6EWJvQRMUf5b5PAiBDxcRYPDkTvrEl1v9aKmeIXKF6BhUpDpu5pfDtfwv1bg==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":99674},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"21b091b05cd91ed1d727ddd64186cee1cf0618f6","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.19.6","dependencies":{"@tscircuit/solver-utils":"^0.0.13"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.76","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.10_1767911120041_0.7080535218513151","host":"s3://npm-registry-packages-npm-production"}},"0.0.11":{"name":"@tscircuit/hypergraph","version":"0.0.11","_id":"@tscircuit/hypergraph@0.0.11","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"cdb85f21fcca72611c3e8a070beee139a5564279","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.11.tgz","fileCount":5,"integrity":"sha512-nRj+7iAEObAMJwkntpDb7NSHdllpqsWCwXQ88AR/SKTsDHU0XeWmi0F5vKz+mPh6V+QJMNyYRpuxV0E1mh0sMQ==","signatures":[{"sig":"MEYCIQD6VdDY/rB0ftIkWtYhd7WG/EbsIemxrc6F3aaAGreiPwIhAOaH+QNpGOpU1rfUsTZce6bBT7F0knt92FTkHIKyFK8E","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":99789},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"43eb3446d42a610ef85b487cbb1a330e8aa70504","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.19.6","dependencies":{"@tscircuit/solver-utils":"^0.0.13"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.76","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.11_1767943630099_0.15840991019172468","host":"s3://npm-registry-packages-npm-production"}},"0.0.12":{"name":"@tscircuit/hypergraph","version":"0.0.12","_id":"@tscircuit/hypergraph@0.0.12","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"383e1a98bba578db407811660527bdf319718282","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.12.tgz","fileCount":5,"integrity":"sha512-7aVII7EJMB/13W46yeH7UVjFTc+Fbwo9LmzsCVHcFIlVGhGWu4UZ3sVbQ3awYwmm5Au0wej2c5n3virC7gNH9A==","signatures":[{"sig":"MEYCIQCgAS1oiXSqP3qYnQyVkCe+TLrb+eH2JiMw+622m9dc8QIhAJtkMKCx8rnJX4k2AUQsQgjEW6JQib9b0NRIJAUWOFX8","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":100095},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"8ee0c6d1d2ca3cae193d7bf5b2290f2e90525cbe","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.19.6","dependencies":{"@tscircuit/solver-utils":"^0.0.13"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.76","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.12_1768112225957_0.1467427371817196","host":"s3://npm-registry-packages-npm-production"}},"0.0.13":{"name":"@tscircuit/hypergraph","version":"0.0.13","_id":"@tscircuit/hypergraph@0.0.13","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"c31afd44df87cd0fbf4269e4c513c397147f0d0a","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.13.tgz","fileCount":5,"integrity":"sha512-2a8oMwVS1gg9MHunypQ5FzRc6WZJg0ucjoonnMctJEgxO7k2TUNP1wb+Ld/3JCsMxwcECXJOVHiGmENeEEoHsw==","signatures":[{"sig":"MEUCIGwJz1gEr2qzgnWXGPw81+HKGAf4Sb59uKgReYy3TFhiAiEAgHF3WH5aWd7biDkTOh8nL/eDBYGxEc2+eh76Aa9KZns=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":101559},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"a1d98f42abc1a4bf10c5487c0e8ba714eb29b1cd","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.19.6","dependencies":{"@tscircuit/solver-utils":"^0.0.13"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.76","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.13_1768163296339_0.6997221540188123","host":"s3://npm-registry-packages-npm-production"}},"0.0.14":{"name":"@tscircuit/hypergraph","version":"0.0.14","_id":"@tscircuit/hypergraph@0.0.14","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"de8832813bf2536a61dc96c6645b9bfb183c89b6","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.14.tgz","fileCount":5,"integrity":"sha512-l8g1fJ68yAj3vg33F5aHWxvL+8saBXAv81084Au9LnkgJmHsxDYGwDv6u+jYF4C4GBnG5dxZc+qpn+M2dVH8FA==","signatures":[{"sig":"MEUCIHQcl+7pSLkv5LJ9uBo33oFRVfNiK4IiWckeqSxwTs8aAiEApwAbaskUAE4zDL82k/yktV+M7PHPuG3DI7lG1gFlSZI=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":103818},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"1039fccfe8a4757433d50c0295f28e478e1073b0","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.19.6","dependencies":{"@tscircuit/solver-utils":"^0.0.13"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.76","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.14_1768263817776_0.19342902984458532","host":"s3://npm-registry-packages-npm-production"}},"0.0.15":{"name":"@tscircuit/hypergraph","version":"0.0.15","_id":"@tscircuit/hypergraph@0.0.15","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"1f824ce5695a93c38881557a5401cd97cc91817d","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.15.tgz","fileCount":5,"integrity":"sha512-9yRGJJoLTYpyioC2stdvu4Wl7HrSTxVjz0ZuQY0h+Eqfh/BKWlPo9cVoTLkYKxwVGlQv76mwtT6b5PjEIKZpPQ==","signatures":[{"sig":"MEYCIQDzbT4lJC5LJy/cbKq0DfHyp92C+CuwnSvxeUaq0dkfWgIhAIUZLnBfECawp4D0fjncPIovH7O6Jyj88jW0yJMz3St0","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":104833},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"5290941c377a6d983cfad66d2dcbe78f1c14ac32","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.19.6","dependencies":{"@tscircuit/solver-utils":"^0.0.13"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.76","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.15_1768330458279_0.5685403112680081","host":"s3://npm-registry-packages-npm-production"}},"0.0.16":{"name":"@tscircuit/hypergraph","version":"0.0.16","_id":"@tscircuit/hypergraph@0.0.16","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"83350f20cc978d9d3770b10fcdf9f6fe473fcfc9","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.16.tgz","fileCount":5,"integrity":"sha512-fq3YiQF+in2sfSYc/u1qijkY4RJu9arM3CM/CyppIGh/xz3Dq6rnA5jBg8/jEuOqD/E2QDA/MnhxPlyKes62VA==","signatures":[{"sig":"MEUCIC//eAoHJLeVKaq/RLH/d2I/qywExAyn1JOQCk7ZZ7l9AiEAxKWlEGol5W1+vGV5BAo5HgRF/1SeX7LUfVUCRjEZz5g=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":104833},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"53badbda36c9257d4ab8c0a8b55eba371c711fed","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.19.6","dependencies":{"@tscircuit/solver-utils":"^0.0.13"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.76","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.16_1768926877038_0.0734494928700331","host":"s3://npm-registry-packages-npm-production"}},"0.0.17":{"name":"@tscircuit/hypergraph","version":"0.0.17","_id":"@tscircuit/hypergraph@0.0.17","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"4bbb6e02c94f4081455083012df0fd86a9a02da3","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.17.tgz","fileCount":5,"integrity":"sha512-MIJpaEpJ/WlsCfTLzB3UFfsCujT3qyUWhXAmauPiYtZq15ATz0nickShcqeVjgHoxjQ1FkKirudaf9Nzu6p7Ng==","signatures":[{"sig":"MEYCIQC7Wu+ZnEw/3GMwXOF9g5Aivlufc7qEweRqx1guZiAyhAIhAOHSJKVmUuiCklSQqc1UOGxBwwJkVjlaM1yFv1pQGM5A","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":104793},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"84a02b737a8fb192ab4271a412f171560828dc8a","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.13"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.76","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.17_1769274366529_0.7250847029916183","host":"s3://npm-registry-packages-npm-production"}},"0.0.18":{"name":"@tscircuit/hypergraph","version":"0.0.18","_id":"@tscircuit/hypergraph@0.0.18","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"325e498ae3b29de95e561a9eb688fa3bf248c508","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.18.tgz","fileCount":5,"integrity":"sha512-uQAKU46u9Fk+LzA+2mzQLHr1mJacSXRA+7JEIR/YEHHpYb0pa5ZiAwodIq0Y6EyZDmNBLE+vSIMK9cJE6RJsog==","signatures":[{"sig":"MEYCIQCWQhLJ06UCt+qiNndU2iGv1CIOPH5QLsSkfmbLFYHy/QIhAMog/EXNDaI4AOlcCUDI6nZZ/M+NKS54mwI/if+hwtNe","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":134108},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"e15552565eb1d78ee62ba9b8b3412b1093a1b36b","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.13"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.76","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.18_1769318570581_0.3423114610852096","host":"s3://npm-registry-packages-npm-production"}},"0.0.19":{"name":"@tscircuit/hypergraph","version":"0.0.19","_id":"@tscircuit/hypergraph@0.0.19","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"06fb0daf83f455134d4805e9147fa0108c6a6ead","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.19.tgz","fileCount":5,"integrity":"sha512-vVmN+OrFDW9MaRkKCzvH7lPGHnOUiwE1pPpRcr97ywPn2DQHOmecNSURhTBS4sb6URM3opmi/xN66VGaUlTbNw==","signatures":[{"sig":"MEYCIQCsfEq8hieDaYZ1w3odfktpYC0H9ZqQwGhLgC1Er1i2qQIhAJxbVj/LZfBj9ZXhpvF1J53+AU+oxjn2/9nnSovjKbxR","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":134277},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"b1b2064f04627d8d457d4b92921aac61160a021e","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.76","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.19_1769366840095_0.05488746038129455","host":"s3://npm-registry-packages-npm-production"}},"0.0.20":{"name":"@tscircuit/hypergraph","version":"0.0.20","_id":"@tscircuit/hypergraph@0.0.20","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"57a6ddbfa9da7e7d24ffe120d15035437e3b20f4","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.20.tgz","fileCount":5,"integrity":"sha512-V1ot0vAsJklyaLNev6dzi3zTpyW+KY3XmeSv6757Ath7LqVaymtsbuGdaV7K8rQ0xNuG1/nS/si2hBj76rLXiQ==","signatures":[{"sig":"MEUCIBG9cNiHcUtse4VY7sAnwB907nsLdmr/4/sprXO61c09AiEA/nACyI/b06kvqRXwoLVj8Ln0I+gulDohs8SNliQSfwM=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":136258},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"9ac34a8159d0c3e566c83eb45494d03f66950c29","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.20_1770564500698_0.3474015956938208","host":"s3://npm-registry-packages-npm-production"}},"0.0.21":{"name":"@tscircuit/hypergraph","version":"0.0.21","_id":"@tscircuit/hypergraph@0.0.21","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"35250f2ac4fd6fa74b7baecfa1476366e8b2c00a","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.21.tgz","fileCount":5,"integrity":"sha512-Jo2WVJaGBAkXjkCHZyE/+qFIoJ38236ZHd6XDgTqRCUjd/hSVt2OS/adPxKQozqbpFZ0pvv4/KhJqfKSnsxi7A==","signatures":[{"sig":"MEUCIQCDDKnpTlDXPHStMrkp/AlxpIpSaSjd7ujlIw+5oJYajAIgYwMEFafbnCCNhLKSLOa8u8P+6jO1J5PSiebQJVKPa7s=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":138137},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"31fef0c30951767b4a5769840cb7e7389de28ddb","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.21_1770698730960_0.4390359547174898","host":"s3://npm-registry-packages-npm-production"}},"0.0.22":{"name":"@tscircuit/hypergraph","version":"0.0.22","_id":"@tscircuit/hypergraph@0.0.22","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"fa9cb1a2be1fe463f95478055be81bc4401f8154","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.22.tgz","fileCount":5,"integrity":"sha512-3SSPEMGfd8tOE4viGTqIAMUGQcPU4MG+gDm4euWZGGV60yCgS+K/2WDfP704oEUc+k58JlnachxfHXEg2YoOjA==","signatures":[{"sig":"MEQCIEix0UL4THCMMDphq1Koi+aUjKpzUm3YSrAEUM/iGweTAiAj1Q+VxsMTyNdk9Ufqp0H6PkrdDYrC62ct35NhaNpSiA==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":187637},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"1aad6816f6df1b75e6b9c93c655936df5d0b5be5","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.22_1771086813023_0.2833634426225464","host":"s3://npm-registry-packages-npm-production"}},"0.0.23":{"name":"@tscircuit/hypergraph","version":"0.0.23","_id":"@tscircuit/hypergraph@0.0.23","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"42ca34e39d6b1611bcec66de72521bb5b18967e1","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.23.tgz","fileCount":5,"integrity":"sha512-mxYNwkcCUWD91eker757QcC7vJCLCQLdJEc6jYq92laW9c6LtBWNfusiRf+Y5OLL2ahU8+EgAkU/UI/vB54VIw==","signatures":[{"sig":"MEUCIQDTzFViETY/p16S/nBvxH17UvYx++LhgnzXf9bXmPFL/gIgCFYAtu4QdpW9v6nTybNe7PP6ONwBfNZByVk8Wh1d6e4=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":187637},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"d2b23e74f6fb4aacaa4272c29c06a34c355f6591","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.23_1771087206347_0.9535916462953984","host":"s3://npm-registry-packages-npm-production"}},"0.0.24":{"name":"@tscircuit/hypergraph","version":"0.0.24","_id":"@tscircuit/hypergraph@0.0.24","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"ac15aa732832cfb7df587518123d5e1127ee64a2","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.24.tgz","fileCount":5,"integrity":"sha512-WnrS3cfgWv06u7S2byx04VQK4HjpPSW+TLuNwMjnV8Om/j5pAIC4iMBxBf7ltQSSnoaXZ09sNsRFdqSQ8negJw==","signatures":[{"sig":"MEUCIGVieTcG91dnOX8tkMiidb5HZED0jp8iaGB2Y9eyRZQtAiEA+WkGEOQdz6VVitXRx9VIJnqQ42DC4KsQN84OOqmfs4Y=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":187637},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"c63225a6ccfca6b6558a05c012eac44a9bbaaf98","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.24_1771238944303_0.6553650440614969","host":"s3://npm-registry-packages-npm-production"}},"0.0.25":{"name":"@tscircuit/hypergraph","version":"0.0.25","_id":"@tscircuit/hypergraph@0.0.25","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"85722e363e99b5a49d0572ef8e8722ac1098728b","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.25.tgz","fileCount":5,"integrity":"sha512-UGi5N+vUcGOT1BTd852n/9uuuj0DyYZVU88e97cvdWfFmvMrIUWSSvViNVbjjru4L15dab1TgyoUP8udLDgpyA==","signatures":[{"sig":"MEUCIQDqaQq2kyAehJwiPLFxIkiq0yw56IuRs88fZ8E9myE9dQIgP5GY7oKuVA0udA5U4P+v91fw41mSp/K2zz1BKc9TkH0=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":187637},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"f6ed21d535998599719b6be2930ee8aa69b2c96f","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.25_1771273115938_0.49955830181677174","host":"s3://npm-registry-packages-npm-production"}},"0.0.26":{"name":"@tscircuit/hypergraph","version":"0.0.26","_id":"@tscircuit/hypergraph@0.0.26","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"1866a10c01f4a32d679bc030c286ffdd89f465ef","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.26.tgz","fileCount":5,"integrity":"sha512-hsfY+MPfJR2icN4/sphaiYLrJv8OIzbUlarR+rfXqe0ueNYrHp61fwJp14I1lU2VAaGOLxJSTbSSIkMfICOD5A==","signatures":[{"sig":"MEYCIQC1bni7cKCqp4fo42K2KjyPB34k2fkkxkZByVej01UzewIhAOa18RCNJvZaReag6JpssI+vRITVy0DIKpTn59T807jL","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":187637},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"d5672829d56da1fb8b34c33f1d2266935be5196b","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.26_1771414095029_0.5341781299899564","host":"s3://npm-registry-packages-npm-production"}},"0.0.27":{"name":"@tscircuit/hypergraph","version":"0.0.27","_id":"@tscircuit/hypergraph@0.0.27","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"b5b89426531be1bc2399db15cd97dab8166cce73","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.27.tgz","fileCount":5,"integrity":"sha512-1LMhTAphhoN+A7qgwzYBnsCYxF8+EoJeAzJZnMrhveQyEskiW4qxYwKwnFhA+ixu9NSDIZ6nK+URTnh/RJ5a2Q==","signatures":[{"sig":"MEYCIQDYNgj9pyx03QaLq2G1kShSFCCkO6iiaPJj/XERgj+cWQIhAMtb6FscGKc/W0J+WsO+SqVh4KQ/RJ8lMymB98okyWnk","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":187637},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"035ddc3238f12ab57a5c8db006b9abd4ab4ee2fe","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.27_1771421096011_0.7317245153868184","host":"s3://npm-registry-packages-npm-production"}},"0.0.28":{"name":"@tscircuit/hypergraph","version":"0.0.28","_id":"@tscircuit/hypergraph@0.0.28","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"c7bbc549ec2a76e56ba6d6802f5305b72f647832","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.28.tgz","fileCount":5,"integrity":"sha512-+ge/FL6926PdApOlmVDDtjk/HbaM/nxX7Kfg1sJ5SwxjSCajwbvplHgje3evdOFkVaLvkvK/T+EXsV59sLYBsA==","signatures":[{"sig":"MEQCIHkaA7Trtm8g1puR+j42aoq0ZMiENOJ7Mi+ySi6/hKj7AiA742HHAFrqgSsBsYXx1CJECLqzmsJmH+ZBISBsg35rbQ==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":187425},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"63d3cd3f59a357e47d610ce28dd77c3124502172","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.28_1771449160052_0.03669529266767868","host":"s3://npm-registry-packages-npm-production"}},"0.0.29":{"name":"@tscircuit/hypergraph","version":"0.0.29","_id":"@tscircuit/hypergraph@0.0.29","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"cc0a3d4ad0bb330c89c852c8d2e3f18e479817bf","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.29.tgz","fileCount":5,"integrity":"sha512-TcxUjjaze5nzx52w8kvSgyO8NJao2monm4Wtck8YDYycNJhUXfv3sjo145xY6RBdHj+/Q7bYrXvL+ehDLyI29Q==","signatures":[{"sig":"MEUCIExMdJS4IZyQTwHOz29wFUfx2w7S4eOul42b/MJBK221AiEApckc1bjQjE2wpL36jyqyvuujGLseL0bAmJwjTXtWFUc=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":191889},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"9951176aa5de5e542b0faa79334078ad1b21e33a","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.29_1771453926301_0.6630926694169956","host":"s3://npm-registry-packages-npm-production"}},"0.0.30":{"name":"@tscircuit/hypergraph","version":"0.0.30","_id":"@tscircuit/hypergraph@0.0.30","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"7cb138aa0a0091d0eebe06e8c6714fd7a25490aa","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.30.tgz","fileCount":5,"integrity":"sha512-CteL9vbCPPIm0xUksguxLCgD+okLbUbBxOtXaBuFZDp2ZYaXS1Gzi6VU9UCL9dBAK38+SrLQq0L8aT2BRw9lsw==","signatures":[{"sig":"MEQCID8ZbPCPyTLIlsGwt9C8MX82y04mFDQV9OIN7XabT0HCAiBOwqOBjVhDu7qy2MQpLOuMwPCZCThkt/D8f6YOVfU/4A==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":502373},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"4ba6a4c5466bda84214d2797037a8748fa5a7621","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.7"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.30_1771538842288_0.04911561992108404","host":"s3://npm-registry-packages-npm-production"}},"0.0.31":{"name":"@tscircuit/hypergraph","version":"0.0.31","_id":"@tscircuit/hypergraph@0.0.31","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"94a5bbf8d652fe66331e0ead0bf5a258b60d728d","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.31.tgz","fileCount":5,"integrity":"sha512-pXU/wxNPBEdj1pFoZiACPyHsxLWe0ymsMu352qDYfJSNU5vuIbCap0BLwmtHXmqS2LtFrl1/Ov6fiFf5Bzv+0w==","signatures":[{"sig":"MEYCIQCUPzKjnttVW/qOQ38uuhllQpsZAvAuaK8+HRVZwkGYygIhAOqDPhqeZ6tPVlgvC3uXfvbt4iw1Y05LP3Z6vyYfrjgY","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":502373},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"3f5fa6ef6038469cbce3ffab8fce6ab214d4ce50","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.7"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.31_1771625989194_0.3859256512893172","host":"s3://npm-registry-packages-npm-production"}},"0.0.32":{"name":"@tscircuit/hypergraph","version":"0.0.32","_id":"@tscircuit/hypergraph@0.0.32","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"fa9247b98f11a19bdb2c7cd288617afbdc001174","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.32.tgz","fileCount":5,"integrity":"sha512-eueRJCzhJXnMUG12UMQafwbDhBPOQqONlTtvX35MNCc159hl+c+eIwdLwwloQ5lLFE/WV8StiGDZ7d1E1TV82g==","signatures":[{"sig":"MEUCIQDVvhd7kjpm/gIevkDWvuMIJUw+4F34F39cW4LSLakzOAIgLsCaNCyL7ln+UDRapoTcMpcpb/TN3bHageq+tNuNHsQ=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":517739},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"69ebf746a4b4ab80503e00ee7c2272ec623e415d","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.7"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.32_1771714871341_0.18745220399058748","host":"s3://npm-registry-packages-npm-production"}},"0.0.33":{"name":"@tscircuit/hypergraph","version":"0.0.33","_id":"@tscircuit/hypergraph@0.0.33","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"2ca4e6ea650ff56a2153ace6fdb789997bd7ebfc","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.33.tgz","fileCount":5,"integrity":"sha512-YcUynDvtqPfoXsQgAFXeIH1gf7mWBb5RWEZN5GHQ6a1t+sidTXp0kavaDl4mqnBRuy1wtGZu4nCUAtsaI9gcjw==","signatures":[{"sig":"MEQCIA1KBLpRtztG0JcWIIEGNcwqW5AQX6MYjO9d5ZftpbZKAiAj56P4zfm0confZ/IjLhBBhis3qfzQ4n7YAD5sDcAYQg==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":517828},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"68ba8ac51d76d4b92040dd92ea28932b2afcbf8d","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.7","@tscircuit/jumper-topology-generator":"^0.0.1"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.33_1771729715078_0.3264409874128005","host":"s3://npm-registry-packages-npm-production"}},"0.0.34":{"name":"@tscircuit/hypergraph","version":"0.0.34","_id":"@tscircuit/hypergraph@0.0.34","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"22dc09e081fd50c03f66cf2f0cade050b3cb8282","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.34.tgz","fileCount":5,"integrity":"sha512-9L5GNSirBaTQKc6YLVqcisfwb1uDzA5MxX6RyaIKjea1lE7tbH8xST0+Xy8d/H3tO6cG3qJzhM0Q0snD5kjnkg==","signatures":[{"sig":"MEQCIH2p/Rb57Ob/axpZ5MlssaSEP3lhf89CFaVXODvmM8IPAiAywDXepWqzmZsQutr43WDFjsLnSBbEQIjsf2QHPsg1mA==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":519281},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"ea5b378fbdab530ca32a88363f1db9dbeff2aaad","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.7","@tscircuit/jumper-topology-generator":"^0.0.1"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.34_1771732611454_0.8264590265660088","host":"s3://npm-registry-packages-npm-production"}},"0.0.35":{"name":"@tscircuit/hypergraph","version":"0.0.35","_id":"@tscircuit/hypergraph@0.0.35","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"c5fe24703ccf0709eebfb4b919e540fda25c4858","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.35.tgz","fileCount":5,"integrity":"sha512-o0d1NHEMUB1yd+W2d8hX49+7y1WvrjPBpm9PfKGmgfoSyKOUXchJ1Sa1NFLgEeMHXW3AJBjQDgE6ebrs6vZOEg==","signatures":[{"sig":"MEQCIGS/Ow3m8Bl2BfpF/l6cMPikIOuM9CYMtXywqoQscOaMAiAva3/aDRdsppMcRfmjx0gWaC6RenJZJpHVR9vhkMfdKQ==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":527213},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"9e82cd7ec9366487f1f59cc5808fa803e558f1c8","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.7","@tscircuit/jumper-topology-generator":"^0.0.2"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.35_1771747328130_0.6989736074155077","host":"s3://npm-registry-packages-npm-production"}},"0.0.36":{"name":"@tscircuit/hypergraph","version":"0.0.36","_id":"@tscircuit/hypergraph@0.0.36","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"447b5610b395c6f87aa506ec2911b9319dda0b51","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.36.tgz","fileCount":5,"integrity":"sha512-ELjQi3X9TIt6basuztN6ug2Vog1A+/nOT/AVmEX6687SbbsXzWdG9LUMd7DZCryXTvuK1aOdB2oB180fbBAuMw==","signatures":[{"sig":"MEQCID110Fi4qIoJYzMem0gP7sZGqprjXIx+LoUq1+mnGn/HAiBOdF2iuaoKZ1rsEoZiKX0mPqJ49t8j300P6wRt625Imw==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":531161},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"bfbf37600b49e8b174104c64531e8b4c24b55a37","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.7","@tscircuit/jumper-topology-generator":"^0.0.2"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.36_1771962091728_0.674919331819436","host":"s3://npm-registry-packages-npm-production"}},"0.0.37":{"name":"@tscircuit/hypergraph","version":"0.0.37","_id":"@tscircuit/hypergraph@0.0.37","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"08d68315dfec136bf4aea3c1a8acfd167a4a3c59","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.37.tgz","fileCount":5,"integrity":"sha512-8In4FpMD9oERLCL2QwHisPIWqW7RLORMJf7++esxZg84gYxP446/rGiYO3hDPs59O3pr04NOwnhHdgpz91xGnA==","signatures":[{"sig":"MEYCIQCAplrZzT7Ezst94qZZqVp18iQYEdTBcIVqJ5YbTTllhwIhAIFMjoyUQtHffVu3RhqF650RfMcEGrgT9tlveFnJYtfk","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":531201},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"6b90dddeaa53cc361fbbfa16fa4538c32040590e","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/hypergraph":"^0.0.35","@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.7","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.37_1771972597379_0.6978872320312062","host":"s3://npm-registry-packages-npm-production"}},"0.0.38":{"name":"@tscircuit/hypergraph","version":"0.0.38","_id":"@tscircuit/hypergraph@0.0.38","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"2d9309fa8d396e04ab2951f1c4175e47d9a4eb8b","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.38.tgz","fileCount":5,"integrity":"sha512-9eu3gsG6IpUgSWQP8XYBQBVIkS6IrtPV3ZPq1+N2EXvyoO8kNfrwRozesZvxnI8O1Up1vK6cTS8epMWwaShalA==","signatures":[{"sig":"MEYCIQCDQfI1BSnObIxtdg2IC5TDY3odtWKNcM1Z2LifSW7/HgIhAL4AxRcDBT8/IZPQArMxlVrr36+rlL2yBfiyoMS8hg6g","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":531201},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"ad9127a34a00ea79ce39cfab22bf95b62632e27c","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/hypergraph":"^0.0.35","@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.7","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.38_1771973783380_0.9693714538112042","host":"s3://npm-registry-packages-npm-production"}},"0.0.39":{"name":"@tscircuit/hypergraph","version":"0.0.39","_id":"@tscircuit/hypergraph@0.0.39","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"9cedc4efab1920a7a92eec91df8605ac30fd4da3","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.39.tgz","fileCount":5,"integrity":"sha512-AiiKYvi+yABj83pwpKOrAWGW7UwD92kJ67QWdiBjX/bUmCS/+Yp0MjECv0jLUPpLJ21bB1NJoRvaRzJROzHPtQ==","signatures":[{"sig":"MEYCIQDOY/E8IaNYO/5AYrC+b95dgoXQResZQoe3JiVfXuGxowIhAM3RUMhVnj5ThHz+RHs8VpPg7crBhqRT8m44iEqf5wWv","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":531986},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"c554df84260b7958d13947e6a2d8d7a696bddb1c","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/hypergraph":"^0.0.35","@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.7","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.39_1772056929370_0.5492971590513829","host":"s3://npm-registry-packages-npm-production"}},"0.0.40":{"name":"@tscircuit/hypergraph","version":"0.0.40","_id":"@tscircuit/hypergraph@0.0.40","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"ffbdcccea7d67acafbd3d86baec52c3b4f1753a7","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.40.tgz","fileCount":5,"integrity":"sha512-8p5DujlSOpIlL+dQZPa4rhd/V2MTNAdqFflkf4y2K7vUdyHw9SNAw2vfEXwb8S019VFbvbPu/GCIrqxyyDaRSQ==","signatures":[{"sig":"MEYCIQDsx0mqiKlzUECEs0l4673eWPBk4wR3LxHLIBgbMWSA0gIhAPl2aXADfyvuU4v2SxQ0PcsJO/Bh65WYCVo/BKDX1mfs","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":532073},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"f34897e08a755b0d8e80b4d0d9504115265246a3","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/hypergraph":"^0.0.35","@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.7","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.40_1772122294324_0.47825389100026716","host":"s3://npm-registry-packages-npm-production"}},"0.0.41":{"name":"@tscircuit/hypergraph","version":"0.0.41","_id":"@tscircuit/hypergraph@0.0.41","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"25edc9581aa24ead3e44953dc683dd6d5a71fe92","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.41.tgz","fileCount":5,"integrity":"sha512-wsIzsAvA2dYCoNzKLde5q1olcK5/UkxSVIAsYIfjEe2IUzzXL95pEH1jFKr/dy3B1PjVERBXHRJKsbm97gFsqw==","signatures":[{"sig":"MEQCIBs2sCKIqzVEU6eBvxsammBT9jf03d4pSIryTA4i9qwnAiAKDTPajKQ+OwhhYEx2guHoDhiGnwUnynF2bua1v6XqDg==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":528214},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"58cefc49814e22e2fb87785d4195ae52f1aede65","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/hypergraph":"^0.0.35","@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.7","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.41_1772125315446_0.8357337185145206","host":"s3://npm-registry-packages-npm-production"}},"0.0.42":{"name":"@tscircuit/hypergraph","version":"0.0.42","_id":"@tscircuit/hypergraph@0.0.42","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"68f4026b383766897cd9a5e4943be73620ba70c7","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.42.tgz","fileCount":5,"integrity":"sha512-mrnHBhbMQCmGAmBsOfGxPCnt0dy1BES8rRAoDMX9xgmvur3SsHuU1AfxN5osfqh4L87vbx4/ebUYHSmUUp9ELg==","signatures":[{"sig":"MEUCIAD6nMxnI48fvXM604c7Rqo81HcCui1FL1GnJOEcMJjhAiEAutGSrZdghfEb/pAghbl0EFulFSKpzIAR5eE9f0r2WFk=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":599962},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"514187bc3a8fe226e756cba8fd67f0178751d83b","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/hypergraph":"^0.0.35","@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.9","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.42_1772141240676_0.03852685142394652","host":"s3://npm-registry-packages-npm-production"}},"0.0.43":{"name":"@tscircuit/hypergraph","version":"0.0.43","_id":"@tscircuit/hypergraph@0.0.43","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"4a37e6b95d09b53c01ceeb8f068a4b9e99f0da93","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.43.tgz","fileCount":5,"integrity":"sha512-sP5oCVsdqJxMYO0BF4wPax4XuW8XsYyLQVtey8IBjgQQ+meM4usKcjzfq/zMGw27ArotUDkznpgRFnd1UHTntw==","signatures":[{"sig":"MEQCID8pXMXX0rqY7H3o+oBLdk7uEsPULPmYcVuZ2KEC0+LiAiBCkFc9IGHxL2FfRLJlyEy/7vx+oUjB2noZ3fVugg58hQ==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":599962},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"571339167053f68f9d70f1e3bf1a27e4c890ba33","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/hypergraph":"^0.0.35","@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.9","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.43_1772216661827_0.21927214624245384","host":"s3://npm-registry-packages-npm-production"}},"0.0.44":{"name":"@tscircuit/hypergraph","version":"0.0.44","_id":"@tscircuit/hypergraph@0.0.44","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"e7d329480221d72c3f8a167e33f834219fe9ced6","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.44.tgz","fileCount":5,"integrity":"sha512-EpbC7z+gkyd93ls11qp+zO/TZlHPsX4FBETWaT65mwziUl8NKoChn4QbJ62hI6ShUeBdf0D8NxphQTZeuFBL0A==","signatures":[{"sig":"MEQCIDTWSD4fOPRL/zz0i9x46soRc61PC7Rr/wYxfAzFD92kAiADL0vYJJMXARuslGEZeMYQWQG0tYEFZVRiYYmnGXRZzg==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":577348},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"6de0033f56350421df1a4bda8bda558906b87b3f","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/hypergraph":"^0.0.35","@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.9","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.44_1772311081611_0.32900534419722804","host":"s3://npm-registry-packages-npm-production"}},"0.0.45":{"name":"@tscircuit/hypergraph","version":"0.0.45","_id":"@tscircuit/hypergraph@0.0.45","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"774e898dfd3e6b016afd25b581828ee1a05475e5","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.45.tgz","fileCount":5,"integrity":"sha512-jH28Cg0y4z9Dk3tGLbYyaj/MqdwlAqdAnqKV+6uk2m8bTyMr0+WmEVuhR3sls2Ia7A++GFOnAUBnqDt8MR6w/w==","signatures":[{"sig":"MEUCIQDC1QPU0FzVS2s086bF+zu5DPFxFANlAZGAsIVZd0wDJgIgPwBOvbSkh9ppMOcKMRiGVPsLaNqWy+qq80n7kPQNJpE=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":590773},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"239cd3041f83ff9f6a291144edc1295d9d2d6d24","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/hypergraph":"^0.0.35","@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.9","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.45_1772322003959_0.2643854159701282","host":"s3://npm-registry-packages-npm-production"}},"0.0.46":{"name":"@tscircuit/hypergraph","version":"0.0.46","_id":"@tscircuit/hypergraph@0.0.46","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"bc09a296dd351be98d2451c712780277ab92b865","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.46.tgz","fileCount":5,"integrity":"sha512-lbbCt8gvwSnWeQygDJfVshsfB4FucOT4Kb6I92n2Z9pDQCikCnUJq4uhyb08hfcUPwkLemCan8Ri35Omtgqruw==","signatures":[{"sig":"MEYCIQCKqvarqMFTwGEUpErv+7DF6TwHE7bRtITSU8uQUO2rwgIhAPVbp39oHXOM7xFC2JQGZ4/3+tOBO59JGMLQcvfGkK9d","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":591447},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"bd5b8ce8b6ef35d6c527091bfb5c5d9016b46cee","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/hypergraph":"^0.0.35","@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.9","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.46_1772341325654_0.3751434632063828","host":"s3://npm-registry-packages-npm-production"}},"0.0.47":{"name":"@tscircuit/hypergraph","version":"0.0.47","_id":"@tscircuit/hypergraph@0.0.47","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"b147bcbac9050e75a86357895cdb798deeb3423c","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.47.tgz","fileCount":5,"integrity":"sha512-213UoHdMIpVomwtnlcWMlvHxLjd+iwTftz7dHkkYAe6nA/bVL8bgKyD+GZq3WRlGQbeWfDTOmQf6hDQz3dLPcQ==","signatures":[{"sig":"MEUCID6Twg0e0+h2Vf2Rz/gWonyIKbCUrXcifsPh2ILAYsC6AiEAy5Y/HA4WoncRbcwADNZWKhUcmjknKj1MCGFda4TUG3k=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":591447},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"4ca99b322303c75d45364b3f13956ecc110c2ff1","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/hypergraph":"^0.0.35","@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.9","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.47_1772383113511_0.41040184807267743","host":"s3://npm-registry-packages-npm-production"}},"0.0.48":{"name":"@tscircuit/hypergraph","version":"0.0.48","_id":"@tscircuit/hypergraph@0.0.48","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"12b08f15ee90242fbaf6210013f67a86bb8dc11e","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.48.tgz","fileCount":5,"integrity":"sha512-YNDebQdcb65/XWfDZ2nWJ5i7jhkoplU8YQ9ZLfjl+RZ/XUq+mcbVG4PaeNPtM5zgk+8KIBcm4wpvITZY45HUFQ==","signatures":[{"sig":"MEUCIQC0wGHUie3E1/cbL2yAwRlYamszXKguc4U6dy46v/CuLAIgB3+gglSzbMtYh4pgTi+kJgsKwCJapjZL8Ua1TwpC7k0=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":600626},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"3cca5bd9a1c33b37db10124a7dc7b524feb4b129","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/hypergraph":"^0.0.35","@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.9","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.48_1772403722612_0.5268867391232022","host":"s3://npm-registry-packages-npm-production"}},"0.0.49":{"name":"@tscircuit/hypergraph","version":"0.0.49","_id":"@tscircuit/hypergraph@0.0.49","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"0f0d3a11f6a999ed5983ecd1168c25f7b2857c98","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.49.tgz","fileCount":5,"integrity":"sha512-i49+PRPnTuUysdUjKTJAQ9ApIPyHJoojtAmr67U3DTmJaFu4nWfqAe2m4jIaV+RmN0Mkdx6F5kvSkhnnvqNzGQ==","signatures":[{"sig":"MEYCIQCtYVm3aA9h5bFmbtXW4Cw9HqJnv1E4XGae2Ebjvi5DggIhAKwRHG7y798ItFPd2mygJnaXOeUtgQ3VCgGmExAAfpRE","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":600586},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"f97a0f2c042f31a832c1f6fe98d833509b4f59ea","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.9","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.49_1772406890043_0.7312356675598715","host":"s3://npm-registry-packages-npm-production"}},"0.0.50":{"name":"@tscircuit/hypergraph","version":"0.0.50","_id":"@tscircuit/hypergraph@0.0.50","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"b69eb8da7ac16c4ecf2b6de6a3541b030d23e3c9","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.50.tgz","fileCount":5,"integrity":"sha512-XCAj1BA3DgSIPmvKxSzUWdPyWBEKnOrzfzAu6GuQy14CluUmcUt5pnSIeJgap3ksj/x3ixBRIoLB4qbwUrHmzw==","signatures":[{"sig":"MEYCIQDdzv/W4EA3mhZAaQOwEsMTdL/qqoLkFalQW11c4dZTFQIhAOarHctFbtPGyqb3dg6GUcUmni4HDcaQ8HwpALeTZ3wi","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":600586},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"7e64c7bbd3b24604560bf755ae15aa50fa593a2a","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.9","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.50_1772458206619_0.21477104863443164","host":"s3://npm-registry-packages-npm-production"}},"0.0.51":{"name":"@tscircuit/hypergraph","version":"0.0.51","_id":"@tscircuit/hypergraph@0.0.51","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"8aae553208a58a20a991ebd7a84bf59019e231aa","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.51.tgz","fileCount":5,"integrity":"sha512-aopmtvqxtA6RKhBkR2EvppSJFsifdu4DHsl5W+CFZCk3pgTiAYbyQHcuhn+7zqjFXDCu+DDxi+c9YkdmIEbz/w==","signatures":[{"sig":"MEYCIQCk6e044I3p/JE7slzTODDXQ089+MRTRxsUzcBsK9WUOwIhANewfeuE2kadayYKY+U3rlxrI+JS8pI44rjXk3bTdHml","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":600586},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"33710fc9996568ac6c120ddeb4e2dc99adcb4df2","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.9","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.51_1772551556524_0.7134351122598925","host":"s3://npm-registry-packages-npm-production"}},"0.0.52":{"name":"@tscircuit/hypergraph","version":"0.0.52","_id":"@tscircuit/hypergraph@0.0.52","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"f5c6d1968f66c465c6912c1afeed5193055210af","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.52.tgz","fileCount":5,"integrity":"sha512-c8BeKLj/6BlpNzWyD0lcZDPyF75snqOWnoPuYltLN/LIXgfAPSvaWJPvKe1nVq2RZ0HUVb0CQzZWhBBoHkigwg==","signatures":[{"sig":"MEYCIQC/0omn2zQYzi8YSGuJdw17B6CmC/yUJAMFt23jazdKpgIhAIHRBzzI8DFTHIGVOlk+cD2caj7il5jHPGt1taOTOXRI","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":628401},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"f0de5cdc099b297852a4f4ddba2fba33b408e343","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.9","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.52_1772643713237_0.2210484801161432","host":"s3://npm-registry-packages-npm-production"}},"0.0.53":{"name":"@tscircuit/hypergraph","version":"0.0.53","_id":"@tscircuit/hypergraph@0.0.53","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"ba09e7dc1bb3bf214ed53a5a01ba6e41d92a488c","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.53.tgz","fileCount":5,"integrity":"sha512-ubJjctY9+BseK0NuO1KXN30e/qWYVYgoW19O3dsM51qmiHo9Igv1BXdw2n5Omga5UpDizcTB0Be4lsEtaMy3VQ==","signatures":[{"sig":"MEUCIQDuT9EZbJAJtH3MYCvWUfgkcM6hrfrHXi1gKcf8hdUEvwIgJTHp7TIGcpUwv77NCY2/WtxiEdFZqB/sNArqAatxQqI=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":628257},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"92e5477ed985cd117cda8d93feb54744d838135c","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.9","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.53_1772673593175_0.08896593150551846","host":"s3://npm-registry-packages-npm-production"}},"0.0.54":{"name":"@tscircuit/hypergraph","version":"0.0.54","_id":"@tscircuit/hypergraph@0.0.54","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"757688eebd499ecd81de447fc5e0a2e7aa5aa25d","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.54.tgz","fileCount":5,"integrity":"sha512-SDuIUDXm5wA5pv6sRM67Sm5QQ+orbM6mxE5rNQr+tpsrH3iVeJR7ewOrRmFtOjhwVzzvx5/D0eA9YZ+Iz3qqrw==","signatures":[{"sig":"MEQCICwNcbwsaba8OL1aPj7myPbnc/GiHqetS8wHK8V5KDdxAiBAJPCu9ubs/s9XRbssLJaEKN2SJE/H/Fr1mtBZWP8I9A==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":628257},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"5ffb00feff6f21168283a455727c050dd55be17a","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.0.9","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.54_1772726385209_0.00837984900095834","host":"s3://npm-registry-packages-npm-production"}},"0.0.55":{"name":"@tscircuit/hypergraph","version":"0.0.55","_id":"@tscircuit/hypergraph@0.0.55","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"cfdab030df523cf4537af48778dacf4790c43a39","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.55.tgz","fileCount":5,"integrity":"sha512-mQSne3v4mXpJr9k5++dDE5muCB6eL5sYK2fq7FVY8Kbm2DkhSBAgwDDC+f13xAJJnH1a0eHKLvZx3tKqELBoyQ==","signatures":[{"sig":"MEQCIGxJb6gSAsRx5wXw9cxLDEv7blJJmX67jzNsjS0+CE4zAiBrvIAvEpBeKk+CcMujSAwJ1d9ZajQ+e1lu5J+lnzsJDg==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":638499},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"138f86aa1d226ba5553118efb38109b963d05b70","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.1.3","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.55_1772808834359_0.44154872058389727","host":"s3://npm-registry-packages-npm-production"}},"0.0.56":{"name":"@tscircuit/hypergraph","version":"0.0.56","_id":"@tscircuit/hypergraph@0.0.56","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"852bf88861ff19ea26fde604f99655da6fe4aaba","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.56.tgz","fileCount":5,"integrity":"sha512-t9Wdx4sjbvNyMm+KhEPBb5JSqbM+vwuae5Ra7525rYjAB6hc4fe6IyG/KCqLnmSKxGpDsZP+fMjeOJLj0J+xtQ==","signatures":[{"sig":"MEUCIHlQ74VxusN3rRdRENbhnzIp+sxcqBlfVAXg3fem6K8GAiEAqFdWMxymd7gawwQb+NxdDpYd7xSqfuz+GhZNKOEYIV0=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":638574},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"127914fab14f8cc915a7c0a38b95042c7b0141c2","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format .","generate:baked-via-tiles":"bun scripts/generate-baked-via-tiles.ts"},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.1.3","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.56_1772810958716_0.04442430349415538","host":"s3://npm-registry-packages-npm-production"}},"0.0.57":{"name":"@tscircuit/hypergraph","version":"0.0.57","_id":"@tscircuit/hypergraph@0.0.57","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"f4c4045b91f3e9aef4bf045bf0da3c33ec491989","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.57.tgz","fileCount":5,"integrity":"sha512-KhfCCHyljINszeB0+D2RHXGuJ/5y1SRj+k03FQGVmpVOA9JjHEYnlZVAZX5SVASjJoLZqYieERNE/OcyuhIxmQ==","signatures":[{"sig":"MEYCIQD8yZ/b0SZrkbD6hytdLuS3To/YUGZE4k1FDKf5xcH1qgIhAPqv1c4jk4R3NAUhWozo0yEl4PiffVRARMjfCXvOVprn","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":722064},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"e59a682bd4ea0d4497add019eaa4b2b0b3cf74fb","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format .","generate:baked-via-tiles":"bun scripts/generate-baked-via-tiles.ts"},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.1.3","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.57_1772830695298_0.2388196998438772","host":"s3://npm-registry-packages-npm-production"}},"0.0.58":{"name":"@tscircuit/hypergraph","version":"0.0.58","_id":"@tscircuit/hypergraph@0.0.58","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"04482b1649e08b3b5832b30a3b588ee4dbd0aac6","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.58.tgz","fileCount":5,"integrity":"sha512-4+nXkdfyyDVnQyvd9ImT9UfarIx6BLM9cWvZ0sD74d1m4Fk5FjEql6cOiUxr7Z02fk6zgg0Sv4rg1/OzCgzk7A==","signatures":[{"sig":"MEYCIQCQZsYtcYbvPvPRcYKj813KqDEsO8sdCFU2Ht7BFUO4gQIhAOXt46NxHCP2irvOaZ5wOjKW23/OpHNx2dy1oXe+4b6A","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":754939},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"f031763335b2bc6094a02377c33053013eadd8e2","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format .","generate:baked-via-tiles":"bun scripts/generate-baked-via-tiles.ts"},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.1.3","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.58_1772842302868_0.9873253666126001","host":"s3://npm-registry-packages-npm-production"}},"0.0.59":{"name":"@tscircuit/hypergraph","version":"0.0.59","_id":"@tscircuit/hypergraph@0.0.59","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"853d31c154c048e70b5a94faae4306507b42ae6f","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.59.tgz","fileCount":5,"integrity":"sha512-hooJqJtXer/wDksvM5rAWm0vO8/a5mRU7fCuZutdIeQzAuMLEyRTZD5KV8b1GGyC1d0XrO1o2EwCLvOo0uEGSQ==","signatures":[{"sig":"MEYCIQC60cOQP6v5Tmy/VYcsmMcGD3g0nz6OlUzsxcXUDd1zJQIhAIPxVIAZHYAMJR1cK9nd8w7zAzWiTQbDotwt/aQT6O8e","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":755104},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"6fff2586c2ae773157ff48c05f0138384c63b919","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format .","generate:baked-via-tiles":"bun scripts/generate-baked-via-tiles.ts"},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.1.3","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.59_1773255209933_0.05609325339572013","host":"s3://npm-registry-packages-npm-production"}},"0.0.60":{"name":"@tscircuit/hypergraph","version":"0.0.60","_id":"@tscircuit/hypergraph@0.0.60","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"bcf2e867973123af98f53216330408dcdd0264e0","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.60.tgz","fileCount":5,"integrity":"sha512-BEa/w0OMlwOJjnqeFoKUP3DjTU5i4kWocOX7ceJgACrBm9L36iiNDceIDPPLc3vyH/MvjRFM96iAFbphcFtqSw==","signatures":[{"sig":"MEUCIQC5/GKsO+0ZbYr4UK06tr0NyTn6UkX90dk91qV5a+Xs4wIgS2E7B8tIQurGRRBWiTb6gVb6uaCnsxJssqeJXkiWkjs=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":755187},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"cb24097cd584dc5018e22353bc80ccc57c299906","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format .","generate:baked-via-tiles":"bun scripts/generate-baked-via-tiles.ts"},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.1.3","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.60_1773385943821_0.3625591643507482","host":"s3://npm-registry-packages-npm-production"}},"0.0.61":{"name":"@tscircuit/hypergraph","version":"0.0.61","_id":"@tscircuit/hypergraph@0.0.61","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"456f59eb6028a248c6d35168f421392b6021c764","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.61.tgz","fileCount":5,"integrity":"sha512-wjItaVYnMilGUZzlxXPC5jKoUbXBScMi/sUkOOSWW2NaCctJHP2grkkJ85FY6wB5RDc0mRwYfSClU9z3jRC71g==","signatures":[{"sig":"MEQCIGszbqe6/pIEflzDqFX2CE1vxJuFLM9S+YNkbHjeIIs8AiACqddi/zXWnNg78cb/Bg7SyjQelvoEdRd38oUb2nyBmQ==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":786230},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"97e26edf205647998fd484ed87daf1d6503291c8","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format .","generate:baked-via-tiles":"bun scripts/generate-baked-via-tiles.ts"},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.1","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.1.3","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.61_1773436617963_0.8558040982327677","host":"s3://npm-registry-packages-npm-production"}},"0.0.62":{"name":"@tscircuit/hypergraph","version":"0.0.62","_id":"@tscircuit/hypergraph@0.0.62","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"50157848acc9acb2a69643ff7727803619f3cafe","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.62.tgz","fileCount":5,"integrity":"sha512-l7GMwUUwZFAJSNaGG1x/aT9WPNBuCDk72H1TAb6YpriplonueneUbecbSiVdfyr1r89WB84NJuIpdTILizYbNg==","signatures":[{"sig":"MEUCIQCCrphSt5w+iH7mfjTWtE2XpLVPYZIRPdkI5SFROhQUsAIgJHflMGJUbC78zQbuaKH8FcLZFPP6Kzp71WdlheFOSuQ=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":786368},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"0a96de70e5f5edd775e31386b3dbe2e974a9a67d","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format .","generate:baked-via-tiles":"bun scripts/generate-baked-via-tiles.ts"},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.14"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","high-density-dataset-z04":"git+https://github.com/tscircuit/high-density-dataset-z04.git#b9128ed52f5a50102b6526319be1d4ec33dca2c2","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.1.3","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.62_1773517799034_0.0395569490738823","host":"s3://npm-registry-packages-npm-production"}},"0.0.63":{"name":"@tscircuit/hypergraph","version":"0.0.63","_id":"@tscircuit/hypergraph@0.0.63","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"92cc87a52bebff1149f9d9af74ebee25992d924d","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.63.tgz","fileCount":5,"integrity":"sha512-Ak8n1ETPOk3NDCosP/dJ0bLFlpyvi69HsNKgqJ8Yha6Cxfh2dzLMcRndFEcmgc1lJiBVJMzpHqPnI1EhtL29aw==","signatures":[{"sig":"MEUCIHQdRdoEthsgUQ4eG8pq0Ts7JSDem38d78W/gagPHx1UAiEArrW6nAaXpGdTG7sqnotF1233NCIcPKpjTSFmzOJ9JqE=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":786368},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"399bb5f28632bc1ab1371835654b51262af69561","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format .","generate:baked-via-tiles":"bun scripts/generate-baked-via-tiles.ts"},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.1","dependencies":{"@tscircuit/solver-utils":"^0.0.16"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","high-density-dataset-z04":"git+https://github.com/tscircuit/high-density-dataset-z04.git#b9128ed52f5a50102b6526319be1d4ec33dca2c2","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.1.3","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.63_1773646537367_0.9551328819332718","host":"s3://npm-registry-packages-npm-production"}},"0.0.64":{"name":"@tscircuit/hypergraph","version":"0.0.64","_id":"@tscircuit/hypergraph@0.0.64","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"243501af9fe6e4850d5e9bb6072348cd37779ba5","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.64.tgz","fileCount":5,"integrity":"sha512-QCMHtzfBsw5nCGAswn47iEe83Q7XPh+W/DPRUemIJ/H61/EaPRxM3o577BdhLhO+tx4tnvt53bsjCJGd+a2x6A==","signatures":[{"sig":"MEUCIE+pN/vuTUvA8bkutSzDbBMvUF+ESV4xejv5JZXTwKMWAiEA+kLo9zSMsnw+w7IiFw9ixK7tUgEN/6QrTNKqe5D5ZjA=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":786286},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"6079275309ef9a4a32ab62b0d9916a4ada6fa4f4","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format .","generate:baked-via-tiles":"bun scripts/generate-baked-via-tiles.ts"},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.16"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","high-density-dataset-z04":"git+https://github.com/tscircuit/high-density-dataset-z04.git#b9128ed52f5a50102b6526319be1d4ec33dca2c2","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.1.3","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.64_1773646990701_0.902285807967937","host":"s3://npm-registry-packages-npm-production"}},"0.0.65":{"name":"@tscircuit/hypergraph","version":"0.0.65","_id":"@tscircuit/hypergraph@0.0.65","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"600cbceaed19302a74c625645b9714494c2a7da2","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.65.tgz","fileCount":5,"integrity":"sha512-ed9PVi+5QaIOKfEeSliwRV2dabWTXNjEYMH6uSFZTJkwhlUow6ITu8YKBm/B7QhZPr8CHr2dWOyZYgQy7C5jCg==","signatures":[{"sig":"MEQCICIztI52TjeWLUQPvVVSbGkEtyVnOsvPmjUc2UdNeXi3AiB66jvqIdEthvLKBz+EelxVbg0XLdUuwvhhWtLt4woUew==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":786107},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"6c3fc0b2770e8b0cb31972fe4451d851eece7884","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format .","generate:baked-via-tiles":"bun scripts/generate-baked-via-tiles.ts"},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.0","dependencies":{"@tscircuit/solver-utils":"^0.0.16"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","high-density-dataset-z04":"git+https://github.com/tscircuit/high-density-dataset-z04.git#b9128ed52f5a50102b6526319be1d4ec33dca2c2","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.1.3","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.65_1773666162832_0.14724572510301748","host":"s3://npm-registry-packages-npm-production"}},"0.0.66":{"name":"@tscircuit/hypergraph","version":"0.0.66","_id":"@tscircuit/hypergraph@0.0.66","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"848a86ad4b1bdfb7ecac67df7e4697e97b867881","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.66.tgz","fileCount":5,"integrity":"sha512-6f8pv3NWTVDFli8lUBIwBlDG0K/zX8ig7GIxFyYQ0GIuYGnOm3yWg8CtZOUuKfiiu4vHzf4iZU7WBfj6NGaXyw==","signatures":[{"sig":"MEQCIDS9rizBWoq8kQxy4gDWTt2yrSmR0Gqie1ElqPUomIsmAiB01ayV8yPDtwHO2P1JPNEAVfyVFxiZRyrZNlhzNAOVcQ==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":786107},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"e5102782e4675cb8c869ae4d86d0c643a9d6bfd4","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format .","generate:baked-via-tiles":"bun scripts/generate-baked-via-tiles.ts"},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.1","dependencies":{"@tscircuit/solver-utils":"^0.0.16"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","high-density-dataset-z04":"git+https://github.com/tscircuit/high-density-dataset-z04.git#b9128ed52f5a50102b6526319be1d4ec33dca2c2","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.1.3","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.66_1773706682156_0.44640120592453214","host":"s3://npm-registry-packages-npm-production"}},"0.0.67":{"name":"@tscircuit/hypergraph","version":"0.0.67","_id":"@tscircuit/hypergraph@0.0.67","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"203a7a1713d2257679a8cd660f6f83a03e990369","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.67.tgz","fileCount":5,"integrity":"sha512-833+cr0h4K6m8ymSPujQ+6Fbqlf4DwLhjvxDWak+e/GUwGVwzTCesxK6j4lMdOX9gVYFgGqbH+MqUsojhb81pQ==","signatures":[{"sig":"MEYCIQCCanaCDamIHhLdZUY+K3QkYSTTx08WbTmNrDcrkJQcNwIhALI19giDzkluNXe7n53y5H0X3jkH74RwNFNYyRqiyj9F","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":791622},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"4513da255eea948583b952b68183f40e2604187b","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format .","generate:baked-via-tiles":"bun scripts/generate-baked-via-tiles.ts"},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.1","dependencies":{"@tscircuit/solver-utils":"^0.0.16"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","stack-svgs":"^0.0.1","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","high-density-dataset-z04":"git+https://github.com/tscircuit/high-density-dataset-z04.git#b9128ed52f5a50102b6526319be1d4ec33dca2c2","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.1.3","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.67_1773778774793_0.34223974396711965","host":"s3://npm-registry-packages-npm-production"}},"0.0.68":{"name":"@tscircuit/hypergraph","version":"0.0.68","_id":"@tscircuit/hypergraph@0.0.68","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"214dbc6462e38462477f726cb3437ab30331a38d","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.68.tgz","fileCount":5,"integrity":"sha512-JaKs8g3V7UKmXp14VIxMGm4GjMCSnHX7ukLqFpJuzTgoZuKsK2b1mb81RBdvGUsvgpxW9anFu4BPY1C5na4UUQ==","signatures":[{"sig":"MEQCIADfnd1BZKO7InU0255EtltGW+q3OwI4gj+u+/Ql2eS8AiAup7qhYc1ShYwjjWE14vNGK1+8oquRJrLg2f0N5PQlwQ==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":791568},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"816522cd9ad9c8a79145bda98ebe198b9725bde6","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format .","generate:baked-via-tiles":"bun scripts/generate-baked-via-tiles.ts"},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.1","dependencies":{"@tscircuit/solver-utils":"^0.0.16"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","stack-svgs":"^0.0.1","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","high-density-dataset-z04":"git+https://github.com/tscircuit/high-density-dataset-z04.git#b9128ed52f5a50102b6526319be1d4ec33dca2c2","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.1.3","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.68_1773784631859_0.24994331623270538","host":"s3://npm-registry-packages-npm-production"}},"0.0.69":{"name":"@tscircuit/hypergraph","version":"0.0.69","_id":"@tscircuit/hypergraph@0.0.69","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"129c0966402aaed183bc7a2e67b75ef1eaaa92e0","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.69.tgz","fileCount":5,"integrity":"sha512-vFb5cZQVeAxML2ReIaUpvMJyBAxHwOUSFMARgkVH4ZoJblk9De6I/NvCi2FgLEBIfKCJOKVXYZbW4vvCYAXucQ==","signatures":[{"sig":"MEUCIAn5zghA/9GxdIeV9BQD2cDU6KP1WhLNZHmuiZPPbYyUAiEAye4DwxJaB5ateCYURQ6Y4d89jg4yRvnAHJOrTQJWRac=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":803824},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"2bc909823b52a170bb3f282e5dc8b45b72637f7b","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format .","generate:baked-via-tiles":"bun scripts/generate-baked-via-tiles.ts"},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.1","dependencies":{"@tscircuit/solver-utils":"^0.0.16"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","stack-svgs":"^0.0.1","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","high-density-dataset-z04":"git+https://github.com/tscircuit/high-density-dataset-z04.git#b9128ed52f5a50102b6526319be1d4ec33dca2c2","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.1.3","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.69_1773788388297_0.6322218910627937","host":"s3://npm-registry-packages-npm-production"}},"0.0.70":{"name":"@tscircuit/hypergraph","version":"0.0.70","_id":"@tscircuit/hypergraph@0.0.70","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"933ac99c72aa3b811e09bac1b9b1e370d113440b","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.70.tgz","fileCount":5,"integrity":"sha512-JIJpzuGKF5ggUGfam6Zad+LEQ9XTMOxaJYlsEC34XGyW2hyqqu8CPaoxsqZ4TW8CVgkN0+hBQedm+8P1wpopiw==","signatures":[{"sig":"MEQCIFs+NAm+eIG9uasJmY47Wb9VqQef5mxvBZC/TjfFW7CDAiBY7aaDCbe65KtbwUWku4obksvRFKmbcVI+ERgwT/hXkA==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":817966},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"1ca11adbafeff24442ad91f1261cd20a8cc7a2a0","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format .","generate:baked-via-tiles":"bun scripts/generate-baked-via-tiles.ts"},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.1","dependencies":{"@tscircuit/solver-utils":"^0.0.16"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","stack-svgs":"^0.0.1","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","high-density-dataset-z04":"git+https://github.com/tscircuit/high-density-dataset-z04.git#b9128ed52f5a50102b6526319be1d4ec33dca2c2","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.1.3","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.70_1773808149367_0.11102525351430792","host":"s3://npm-registry-packages-npm-production"}},"0.0.71":{"name":"@tscircuit/hypergraph","version":"0.0.71","_id":"@tscircuit/hypergraph@0.0.71","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"5409c5be646b5b286f3be551d0548b4e2079ed38","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.71.tgz","fileCount":5,"integrity":"sha512-pTMosHibUiN8Ue14DHHzqLBkXFVECN3qqSwBc+OZufhRDxIczADQ4J2qHoVcgqr4yXNQs3v9qzC+Dzgo/N7RlA==","signatures":[{"sig":"MEYCIQDyNWtgaOZ7lfV9FfL8vOhG2CF7MNBEeM4sTV8tBThVkAIhAOLBZYA+5cf1zYIpqHoNKMjT1GKsT+5aKt4Y3W4/1jdj","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":819715},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"006231bc63e89fddbe385755125797bb23b4088d","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format .","generate:baked-via-tiles":"bun scripts/generate-baked-via-tiles.ts"},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.1","dependencies":{"@tscircuit/solver-utils":"^0.0.16"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","stack-svgs":"^0.0.1","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","high-density-dataset-z04":"git+https://github.com/tscircuit/high-density-dataset-z04.git#b9128ed52f5a50102b6526319be1d4ec33dca2c2","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/find-convex-regions":"^0.1.3","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.71_1773879005047_0.8917787573901623","host":"s3://npm-registry-packages-npm-production"}},"0.0.72":{"name":"@tscircuit/hypergraph","version":"0.0.72","_id":"@tscircuit/hypergraph@0.0.72","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"homepage":"https://github.com/tscircuit/hypergraph#readme","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"dist":{"shasum":"bff5f84c1f19d5b61805a2d7875cc0a9de6e7b35","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.72.tgz","fileCount":5,"integrity":"sha512-xS/ZRdARhnGUGnll00752NeidOKliCs/zLzZPr8AvB8NnZ6gcL6AfDGNMd+dMEya7EE58ECMAeB/zYc6HJY02A==","signatures":[{"sig":"MEYCIQCeOxpMsNjiphNXWrqgAvgLB0bbPKwk78WaajNkuHcEIgIhAKNciNHeRWDVMc04VKvl43UvK9yqKpXj72VyPXcwmP/P","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":213105},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","gitHead":"7a891d60439f427463a0c7f54020675f7d878bb9","scripts":{"build":"tsup ./lib/index.ts --dts --format esm","start":"cosmos","format":"biome format --write .","build:site":"cosmos-export","format:check":"biome format ."},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"repository":{"url":"git+https://github.com/tscircuit/hypergraph.git","type":"git"},"_npmVersion":"10.8.2","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","directories":{},"_nodeVersion":"20.20.1","dependencies":{"@tscircuit/solver-utils":"^0.0.16"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.5.1","@types/bun":"latest","stack-svgs":"^0.0.1","react-cosmos":"^7.1.0","bun-match-svg":"^0.0.15","@biomejs/biome":"^2.3.11","graphics-debug":"^0.0.83","@tscircuit/math-utils":"^0.0.29","transformation-matrix":"^3.1.0","high-density-dataset-z04":"git+https://github.com/tscircuit/high-density-dataset-z04.git#b9128ed52f5a50102b6526319be1d4ec33dca2c2","react-cosmos-plugin-vite":"^7.1.0","@tscircuit/jumper-topology-generator":"^0.0.4"},"peerDependencies":{"typescript":"^5"},"_npmOperationalInternal":{"tmp":"tmp/hypergraph_0.0.72_1775019828282_0.4045656384719838","host":"s3://npm-registry-packages-npm-production"}},"0.0.73":{"name":"@tscircuit/hypergraph","main":"dist/index.js","version":"0.0.73","type":"module","scripts":{"start":"cosmos","format":"biome format --write .","format:check":"biome format .","build:site":"cosmos-export","build":"tsup ./lib/index.ts --dts --format esm"},"repository":{"type":"git","url":"git+https://github.com/tscircuit/hypergraph.git"},"devDependencies":{"@biomejs/biome":"^2.3.11","@tscircuit/jumper-topology-generator":"^0.0.4","@tscircuit/math-utils":"^0.0.29","@types/bun":"latest","bun-match-svg":"^0.0.15","graphics-debug":"^0.0.83","high-density-dataset-z04":"git+https://github.com/tscircuit/high-density-dataset-z04.git#b9128ed52f5a50102b6526319be1d4ec33dca2c2","react-cosmos":"^7.1.0","react-cosmos-plugin-vite":"^7.1.0","stack-svgs":"^0.0.1","transformation-matrix":"^3.1.0","tsup":"^8.5.1"},"peerDependencies":{"typescript":"^5"},"dependencies":{"@tscircuit/solver-utils":"^0.0.16"},"_id":"@tscircuit/hypergraph@0.0.73","gitHead":"06c50030397bdb04a951a8315c226bd857dbed54","types":"./dist/index.d.ts","description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"homepage":"https://github.com/tscircuit/hypergraph#readme","_nodeVersion":"20.20.2","_npmVersion":"10.8.2","dist":{"integrity":"sha512-JgJVXAKQk50UrqmFexy10tolSDb/FSlnqwhZTfZctWwOghLIfpbH5y5wifFSGrtXlipaPw/749MjZ0S6bGzwCQ==","shasum":"120ba01f2e394c8b33d41c9df750bf2ec133f7ff","tarball":"https://registry.npmjs.org/@tscircuit/hypergraph/-/hypergraph-0.0.73.tgz","fileCount":5,"unpackedSize":214336,"signatures":[{"keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U","sig":"MEUCID0ZRfnUG7gsd//6ql4nIUPJ7PE1iBlBmdHwkO54niUDAiEAnfC78vgdU8JvVFJsd1MdrOx8YBgYJnDmefwTpjIfSiE="}]},"_npmUser":{"name":"seveibar","email":"seveibar@gmail.com"},"directories":{},"maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages-npm-production","tmp":"tmp/hypergraph_0.0.73_1777830735147_0.38307390558503984"},"_hasShrinkwrap":false}},"time":{"created":"2026-01-06T23:08:51.018Z","modified":"2026-05-03T17:52:15.433Z","0.0.1":"2026-01-06T23:08:51.258Z","0.0.2":"2026-01-06T23:10:16.265Z","0.0.3":"2026-01-07T03:39:06.227Z","0.0.4":"2026-01-07T18:14:11.517Z","0.0.5":"2026-01-07T20:21:10.371Z","0.0.6":"2026-01-07T23:34:29.041Z","0.0.7":"2026-01-07T23:36:59.071Z","0.0.8":"2026-01-08T01:27:13.321Z","0.0.9":"2026-01-08T06:14:03.039Z","0.0.10":"2026-01-08T22:25:20.248Z","0.0.11":"2026-01-09T07:27:10.238Z","0.0.12":"2026-01-11T06:17:06.136Z","0.0.13":"2026-01-11T20:28:16.477Z","0.0.14":"2026-01-13T00:23:37.985Z","0.0.15":"2026-01-13T18:54:18.447Z","0.0.16":"2026-01-20T16:34:37.180Z","0.0.17":"2026-01-24T17:06:06.687Z","0.0.18":"2026-01-25T05:22:50.721Z","0.0.19":"2026-01-25T18:47:20.243Z","0.0.20":"2026-02-08T15:28:20.854Z","0.0.21":"2026-02-10T04:45:31.090Z","0.0.22":"2026-02-14T16:33:33.179Z","0.0.23":"2026-02-14T16:40:06.516Z","0.0.24":"2026-02-16T10:49:04.471Z","0.0.25":"2026-02-16T20:18:36.180Z","0.0.26":"2026-02-18T11:28:15.193Z","0.0.27":"2026-02-18T13:24:56.151Z","0.0.28":"2026-02-18T21:12:40.207Z","0.0.29":"2026-02-18T22:32:06.482Z","0.0.30":"2026-02-19T22:07:22.442Z","0.0.31":"2026-02-20T22:19:49.467Z","0.0.32":"2026-02-21T23:01:11.521Z","0.0.33":"2026-02-22T03:08:35.241Z","0.0.34":"2026-02-22T03:56:51.659Z","0.0.35":"2026-02-22T08:02:08.303Z","0.0.36":"2026-02-24T19:41:31.936Z","0.0.37":"2026-02-24T22:36:37.536Z","0.0.38":"2026-02-24T22:56:23.533Z","0.0.39":"2026-02-25T22:02:09.559Z","0.0.40":"2026-02-26T16:11:34.487Z","0.0.41":"2026-02-26T17:01:55.597Z","0.0.42":"2026-02-26T21:27:20.807Z","0.0.43":"2026-02-27T18:24:21.996Z","0.0.44":"2026-02-28T20:38:01.761Z","0.0.45":"2026-02-28T23:40:04.277Z","0.0.46":"2026-03-01T05:02:05.828Z","0.0.47":"2026-03-01T16:38:33.672Z","0.0.48":"2026-03-01T22:22:02.773Z","0.0.49":"2026-03-01T23:14:50.204Z","0.0.50":"2026-03-02T13:30:06.751Z","0.0.51":"2026-03-03T15:25:56.685Z","0.0.52":"2026-03-04T17:01:53.406Z","0.0.53":"2026-03-05T01:19:53.395Z","0.0.54":"2026-03-05T15:59:45.376Z","0.0.55":"2026-03-06T14:53:54.489Z","0.0.56":"2026-03-06T15:29:18.935Z","0.0.57":"2026-03-06T20:58:15.468Z","0.0.58":"2026-03-07T00:11:43.060Z","0.0.59":"2026-03-11T18:53:30.181Z","0.0.60":"2026-03-13T07:12:23.971Z","0.0.61":"2026-03-13T21:16:58.112Z","0.0.62":"2026-03-14T19:49:59.191Z","0.0.63":"2026-03-16T07:35:37.570Z","0.0.64":"2026-03-16T07:43:10.845Z","0.0.65":"2026-03-16T13:02:43.030Z","0.0.66":"2026-03-17T00:18:02.416Z","0.0.67":"2026-03-17T20:19:35.055Z","0.0.68":"2026-03-17T21:57:12.044Z","0.0.69":"2026-03-17T22:59:48.458Z","0.0.70":"2026-03-18T04:29:09.604Z","0.0.71":"2026-03-19T00:10:05.243Z","0.0.72":"2026-04-01T05:03:48.476Z","0.0.73":"2026-05-03T17:52:15.287Z"},"bugs":{"url":"https://github.com/tscircuit/hypergraph/issues"},"homepage":"https://github.com/tscircuit/hypergraph#readme","repository":{"type":"git","url":"git+https://github.com/tscircuit/hypergraph.git"},"description":"A generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.","maintainers":[{"name":"seveibar","email":"seveibar@gmail.com"}],"readme":"# @tscircuit/hypergraph\n\nA generic A* pathfinding solver for routing connections through hypergraphs. Designed for circuit routing problems but extensible to any graph-based pathfinding scenario.\n\n## Installation\n\n```bash\nnpm install @tscircuit/hypergraph\n```\n\n## Overview\n\nHyperGraphSolver implements an A* algorithm that routes connections through a hypergraph data structure where:\n\n- **Regions** are nodes representing spaces in your problem domain\n- **Ports** are edges connecting two regions (the boundary between them)\n- **Connections** define start and end regions that need to be linked\n\nThe solver finds optimal paths through the graph while handling conflicts via \"ripping\" - the ability to reroute existing paths when they block new connections.\n\n## Core Types\n\n```typescript\ninterface Region {\n  regionId: string\n  ports: RegionPort[]\n  d: any // Domain-specific data (e.g., bounds, coordinates)\n  assignments?: RegionPortAssignment[]\n}\n\ninterface RegionPort {\n  portId: string\n  region1: Region\n  region2: Region\n  d: any // Domain-specific data (e.g., x, y position)\n  assignment?: PortAssignment\n  ripCount?: number\n}\n\ninterface Connection {\n  connectionId: string\n  mutuallyConnectedNetworkId: string\n  startRegion: Region\n  endRegion: Region\n  startPortId?: string\n  endPortId?: string\n}\n\ninterface HyperGraph {\n  regions: Region[]\n  ports: RegionPort[]\n}\n```\n\n## Basic Usage\n\n```typescript\nimport { HyperGraphSolver } from \"@tscircuit/hypergraph\"\n\nconst solver = new HyperGraphSolver({\n  inputGraph: {\n    regions: [...],\n    ports: [...],\n  },\n  inputConnections: [\n    { connectionId: \"c1\", mutuallyConnectedNetworkId: \"net1\", startRegion: regionA, endRegion: regionB },\n    { connectionId: \"c2\", mutuallyConnectedNetworkId: \"net2\", startRegion: regionC, endRegion: regionD },\n  ],\n})\n\nsolver.solve()\n\nif (solver.solved) {\n  console.log(solver.solvedRoutes)\n}\n```\n\n## Configuration Options\n\n| Option | Type | Default | Description |\n|--------|------|---------|-------------|\n| `inputGraph` | `HyperGraph \\| SerializedHyperGraph` | required | The graph with regions and ports |\n| `inputConnections` | `Connection[]` | required | Connections to route |\n| `greedyMultiplier` | `number` | `1.0` | Weight for heuristic score (higher = greedier search) |\n| `rippingEnabled` | `boolean` | `false` | Allow rerouting existing paths to resolve conflicts |\n| `ripCost` | `number` | `0` | Additional cost penalty when ripping is required |\n\n## Creating a Custom Solver\n\nHyperGraphSolver is designed to be extended. Override these methods to customize behavior for your domain:\n\n```typescript\nimport { HyperGraphSolver, Region, RegionPort, Candidate } from \"@tscircuit/hypergraph\"\n\nclass MyCustomSolver extends HyperGraphSolver<MyRegion, MyPort> {\n  /**\n   * Estimate cost from a port to the destination region.\n   * Used for the A* heuristic.\n   */\n  estimateCostToEnd(port: MyPort): number {\n    // Return estimated distance/cost to currentEndRegion\n  }\n\n  /**\n   * Compute heuristic score for a candidate.\n   * Default uses estimateCostToEnd().\n   */\n  computeH(candidate: Candidate<MyRegion, MyPort>): number {\n    return this.estimateCostToEnd(candidate.port)\n  }\n\n  /**\n   * Return penalty for using a port (e.g., if previously ripped).\n   */\n  getPortUsagePenalty(port: MyPort): number {\n    return port.ripCount ?? 0\n  }\n\n  /**\n   * Cost increase when routing through a region using two specific ports.\n   * Useful for penalizing crossings or congestion.\n   */\n  computeIncreasedRegionCostIfPortsAreUsed(\n    region: MyRegion,\n    port1: MyPort,\n    port2: MyPort\n  ): number {\n    return 0\n  }\n\n  /**\n   * Detect assignments that conflict with using port1 and port2 together.\n   * Return assignments that must be ripped.\n   */\n  getRipsRequiredForPortUsage(\n    region: MyRegion,\n    port1: MyPort,\n    port2: MyPort\n  ): RegionPortAssignment[] {\n    return []\n  }\n\n  /**\n   * Filter candidates entering a region to reduce redundant exploration.\n   */\n  selectCandidatesForEnteringRegion(\n    candidates: Candidate<MyRegion, MyPort>[]\n  ): Candidate<MyRegion, MyPort>[] {\n    return candidates\n  }\n\n  /**\n   * Hook called after each route is solved.\n   */\n  routeSolvedHook(solvedRoute: SolvedRoute): void {\n    // Custom logic after route completion\n  }\n}\n```\n\n## Solver Output\n\nAfter calling `solve()`, access results via:\n\n```typescript\nsolver.solved         // boolean - true if all connections routed\nsolver.solvedRoutes   // SolvedRoute[] - array of solved paths\nsolver.iterations     // number - iterations used\nsolver.failed         // boolean - true if max iterations exceeded\n```\n\nEach `SolvedRoute` contains:\n\n```typescript\ninterface SolvedRoute {\n  connection: Connection      // The connection that was routed\n  path: Candidate[]           // Sequence of candidates forming the path\n  requiredRip: boolean        // Whether ripping was needed\n}\n```\n\n## Serialized Input Format\n\nFor JSON serialization, use ID references instead of object references:\n\n```typescript\ninterface SerializedHyperGraph {\n  regions: Array<{\n    regionId: string\n    d: any\n  }>\n  ports: Array<{\n    portId: string\n    region1Id: string\n    region2Id: string\n    d: any\n  }>\n}\n\ninterface SerializedConnection {\n  connectionId: string\n  mutuallyConnectedNetworkId: string\n  startRegionId: string\n  endRegionId: string\n  startPortId?: string\n  endPortId?: string\n}\n```\n\nThe solver automatically converts serialized inputs to hydrated object references.\n\n## Algorithm\n\nHyperGraphSolver uses A* pathfinding:\n\n1. Initialize candidate queue with all ports of the start region\n2. Process candidates in priority order (lowest `f = g + h * greedyMultiplier`)\n3. When reaching the destination, trace back through parent pointers\n4. Handle conflicts by ripping (removing conflicting routes and re-queuing them)\n5. Continue until all connections are routed or max iterations exceeded\n\n## Example Implementation\n\nFor a complete real-world implementation, see [JumperGraphSolver](./lib/JumperGraphSolver/JumperGraphSolver.ts) which extends HyperGraphSolver for PCB resistor network routing.\n\n## License\n\nMIT\n","readmeFilename":"README.md"}