{"id":15646154,"url":"https://github.com/daniel-beard/dstarlitejava","last_synced_at":"2025-04-30T11:56:17.166Z","repository":{"id":4569081,"uuid":"5710464","full_name":"daniel-beard/DStarLiteJava","owner":"daniel-beard","description":"A java implementation of the incremental heuristic search algorithm D* Lite.","archived":false,"fork":false,"pushed_at":"2017-04-19T17:42:55.000Z","size":11,"stargazers_count":54,"open_issues_count":1,"forks_count":17,"subscribers_count":8,"default_branch":"master","last_synced_at":"2025-02-25T07:41:13.318Z","etag":null,"topics":["dstarlite","game-development","java","pathfinding"],"latest_commit_sha":null,"homepage":null,"language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/daniel-beard.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2012-09-07T00:30:59.000Z","updated_at":"2025-01-08T08:52:37.000Z","dependencies_parsed_at":"2022-08-26T19:11:35.820Z","dependency_job_id":null,"html_url":"https://github.com/daniel-beard/DStarLiteJava","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/daniel-beard%2FDStarLiteJava","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/daniel-beard%2FDStarLiteJava/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/daniel-beard%2FDStarLiteJava/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/daniel-beard%2FDStarLiteJava/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/daniel-beard","download_url":"https://codeload.github.com/daniel-beard/DStarLiteJava/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":242650894,"owners_count":20163610,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["dstarlite","game-development","java","pathfinding"],"created_at":"2024-10-03T12:11:37.918Z","updated_at":"2025-03-09T05:30:20.159Z","avatar_url":"https://github.com/daniel-beard.png","language":"Java","readme":"DStarLiteJava\n=============\n\nA java implementation of the incremental heuristic search algorithm D* Lite.\n\nGetting Started\n=============\n\nImport the DStarLite, Pair and State files into your project.\n\nExample usage: \n\n      //Create pathfinder\n      DStarLite pf = new DStarLite();\n      //set start and goal nodes\n      pf.init(0,1,3,1);\n      //set impassable nodes\n      pf.updateCell(2, 1, -1);\n      pf.updateCell(2, 0, -1);\n      pf.updateCell(2, 2, -1);\n      pf.updateCell(3, 0, -1);\n\n      //perform the pathfinding\n      pf.replan();\n\n      //get and print the path\n      List\u003cState\u003e path = pf.getPath();\n      for (State i : path)\n      {   \n         System.out.println(\"x: \" + i.x + \" y: \" + i.y);\n      }   \n      \nLicense\n=============\nMIT","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdaniel-beard%2Fdstarlitejava","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdaniel-beard%2Fdstarlitejava","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdaniel-beard%2Fdstarlitejava/lists"}