{"_id":"@ajainvivek/layouts","name":"@ajainvivek/layouts","dist-tags":{"latest":"0.84.1"},"versions":{"0.84.1":{"name":"@ajainvivek/layouts","version":"0.84.1","peerDependencies":{},"dependencies":{"tslib":"^2.3.0"},"license":"MIT","repository":{"type":"git","url":"git+https://github.com/ajainvivek/plait.git"},"keywords":["mind map","layouts"],"module":"fesm2022/ajainvivek-layouts.mjs","typings":"index.d.ts","exports":{"./package.json":{"default":"./package.json"},".":{"types":"./index.d.ts","default":"./fesm2022/ajainvivek-layouts.mjs"}},"sideEffects":false,"_id":"@ajainvivek/layouts@0.84.1","gitHead":"1eed400e03c2b29ade45c1d80a097888a0ea7794","description":"It is used to implement the mind map automatic layout algorithm. Based on an independent algorithm, the mind map node layout logic can be decoupled from other functions. The automatic layout algorithm only focuses on the location distribution of nodes.","bugs":{"url":"https://github.com/ajainvivek/plait/issues"},"homepage":"https://github.com/ajainvivek/plait#readme","_nodeVersion":"20.15.1","_npmVersion":"10.7.0","dist":{"integrity":"sha512-0Ovp3L6YJPflOgzQlFDc0WbRBdmIonAdHjhAce7cyluT0eAwLIpIIu/vISoomePxHn5s7f2qxPTy5OJtfxWRIw==","shasum":"723c1fd618b67ff6963e1296df351eeb0f52beb1","tarball":"https://registry.npmjs.org/@ajainvivek/layouts/-/layouts-0.84.1.tgz","fileCount":16,"unpackedSize":116222,"signatures":[{"keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U","sig":"MEQCIGWoVcnfLdT7dR1Grbitv0c2pGlAd1YNoLjV8Z5UYmZVAiB4WXleC+K/G9gNwwtGYe5MVIRMYKOZQe7fePvFLl3QYg=="}]},"_npmUser":{"name":"ajainvivek","email":"ajainvivek07@gmail.com"},"directories":{},"maintainers":[{"name":"ajainvivek","email":"ajainvivek07@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages-npm-production","tmp":"tmp/layouts_0.84.1_1756206112227_0.014914923555884307"},"_hasShrinkwrap":false}},"time":{"created":"2025-08-26T11:01:52.156Z","0.84.1":"2025-08-26T11:01:52.434Z","modified":"2025-08-26T11:01:52.652Z"},"maintainers":[{"name":"ajainvivek","email":"ajainvivek07@gmail.com"}],"description":"It is used to implement the mind map automatic layout algorithm. Based on an independent algorithm, the mind map node layout logic can be decoupled from other functions. The automatic layout algorithm only focuses on the location distribution of nodes.","homepage":"https://github.com/ajainvivek/plait#readme","keywords":["mind map","layouts"],"repository":{"type":"git","url":"git+https://github.com/ajainvivek/plait.git"},"bugs":{"url":"https://github.com/ajainvivek/plait/issues"},"license":"MIT","readme":"# @plait/layouts\n\nIt is used to implement the mind map automatic layout algorithm. Based on an independent algorithm, the mind map node layout logic can be decoupled from other functions. The automatic layout algorithm only focuses on the location distribution of nodes.\n\n\n**Layout Classification**\n\n1. Logical layout\n1. Standard layout\n1. Indent layout\n1. Layout nesting\n\n\n> Timeline and fishbone are not supported yet\n\n\n\n**Algorithm Implementation**\n\nThe layout algorithm in this library mainly refers to the implementation ideas in the paper [Drawing Non-layered Tidy Trees in Linear Time], and has been appropriately transformed. The abstraction of nodes also follows the abstract implementation in the paper.\n\n### Reference\n\nFor the paper, see: [https://github.com/Klortho/d3-flextree/tree/master/papers]()\n\n\nopen source library: [https://github.com/leungwensen/mindmap-layouts](https://github.com/leungwensen/mindmap-layouts)","readmeFilename":"README.md","_rev":"1-7f11a93d3aeb660a2d1cab1eebb95c26"}