{"id":"krungkualalumpur/pathfinding","name":"pathfinding","scope":"krungkualalumpur","platform":"roblox","description":"Mirrored from the Wally registry.","version":"0.1.2","latest":"0.1.2","versions":["0.1.0","0.1.1","0.1.2"],"license":"MIT","licenseRating":"safe","licenseCaveats":["License identified from the packaged LICENSE file; the manifest declared none."],"licenseVerified":true,"dependencies":{},"integrity":"bfaa094d1188917e74a413bf4b737b1482373469d551e680418d96afcab05e72","likes":0,"downloads":0,"install":"forest install krungkualalumpur/pathfinding","url":"https://forest.dev/p/roblox/krungkualalumpur/pathfinding","files":"https://api.forest.dev/ai/package/roblox/krungkualalumpur/pathfinding/files","readme":"# Pathfinding\r\n \r\nA simple djikstra pathfinding algorithm used in luau. \r\n\r\n## Introduction\r\nThis library defines position points as PointData, which in detail is as follows:\r\n\r\n```\r\nPointData = {\r\n\tPointId : number,            --the id of the point \r\n\t[\"Neighbours\"] : { \r\n\t\t[number] : PointData \r\n\t},                           -- the point's neighbour(s)\r\n\tObstacled : boolean,         -- if the point cannot be passed\r\n\tCost : number,               -- the higher the cost, the less likely the algorithm chooses this point to pass through\r\n\r\n\tCame_From : PointData ?      -- used internally - not needed to be used\r\n}\r\n```\r\n## Installation\r\n### Wally \r\npathfinding = \"krungkualalumpur/pathfinding@0.1.1\"\r\n\r\n## How to use?\r\nUse the method ```djikstraPathfinding``` for performance optimized pathfinding search.\r\n\r\nStart by passing neccessary parameters \r\n```\r\npathfinding.djikstraPathfinding(\r\n    PointsData,     -- a table consisting PointData\r\n    startPoint,     -- the starting point in the form of PointData\r\n    endPoint        -- the ending point in the form of Point Data\r\n)\r\n```\r\n","readmeTruncated":false}