{"id":14960897,"url":"https://github.com/hasanbayatme/unity-dijkstras-pathfinding","last_synced_at":"2025-10-24T19:30:30.439Z","repository":{"id":197364387,"uuid":"110816587","full_name":"hasanbayatme/unity-dijkstras-pathfinding","owner":"hasanbayatme","description":"Dijkstra's Pathfinding Algorithm Unity Implementation. (Not being maintained by me, it is just an experiment.)","archived":false,"fork":false,"pushed_at":"2019-06-07T18:16:51.000Z","size":32,"stargazers_count":88,"open_issues_count":1,"forks_count":8,"subscribers_count":11,"default_branch":"master","last_synced_at":"2024-09-27T23:23:00.983Z","etag":null,"topics":["algorithm","algorithm-library","csharp","csharp-code","csharp-library","dijkstra","dijkstra-algorithm","dijkstra-shortest-path","dijsktra-shortest-path","implementation","pathfinding","pathfinding-algorithm","pathfinding-library","unity","unity-3d","unity-scripts","unity2d","unity3d"],"latest_commit_sha":null,"homepage":"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm","language":"C#","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/hasanbayatme.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":".github/FUNDING.yml","license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null},"funding":{"github":null,"patreon":null,"open_collective":null,"ko_fi":null,"tidelift":null,"community_bridge":null,"liberapay":null,"issuehunt":null,"otechie":null,"custom":null}},"created_at":"2017-11-15T10:03:10.000Z","updated_at":"2024-08-02T13:42:56.000Z","dependencies_parsed_at":null,"dependency_job_id":"986c88f0-8cc0-4ed1-bf56-b94c57f64853","html_url":"https://github.com/hasanbayatme/unity-dijkstras-pathfinding","commit_stats":null,"previous_names":["hasanbayatme/unity-dijkstras-pathfinding"],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hasanbayatme%2Funity-dijkstras-pathfinding","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hasanbayatme%2Funity-dijkstras-pathfinding/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hasanbayatme%2Funity-dijkstras-pathfinding/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hasanbayatme%2Funity-dijkstras-pathfinding/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/hasanbayatme","download_url":"https://codeload.github.com/hasanbayatme/unity-dijkstras-pathfinding/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":219868061,"owners_count":16555878,"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":["algorithm","algorithm-library","csharp","csharp-code","csharp-library","dijkstra","dijkstra-algorithm","dijkstra-shortest-path","dijsktra-shortest-path","implementation","pathfinding","pathfinding-algorithm","pathfinding-library","unity","unity-3d","unity-scripts","unity2d","unity3d"],"created_at":"2024-09-24T13:23:23.585Z","updated_at":"2025-10-24T19:30:30.089Z","avatar_url":"https://github.com/hasanbayatme.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Unity Dijkstra's Pathfinding\n\n**Note**: Not being maintained by me, it was just an experiment for learning unity and c# concepts ((I may publish a complete package for this manner in future))\n\nDijkstra's Pathfinding Algorithm Unity Implementation.\n\nIt is the implementation of [Dijkstra's Pathfinding Algorithm](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm) in [Unity (Game Engine)](https://unity3d.com) that let's you find the shortest path between two Nodes in a Graph.\n\n![Dijkstra_Animation](https://upload.wikimedia.org/wikipedia/commons/5/57/Dijkstra_Animation.gif)\n\nIn this example we are going to find the shortest path from **Node A** to **Node F**:\n\n![Sample 1](https://i.imgur.com/WHQn8lf.gif)\n\nIn this example we will try to follow the path using a simple Cube object:\n\n![Sample 2](https://i.imgur.com/dcDpawc.gif)\n\n## Getting Started\n\n- [Download](#download) the project\n- Open in Unity\n- Go to Demo scene\n- [See Usage](#usage)\n\n## Download\n\nFollow one of the below ways to download the project:\n\n- Clone (Run the below command in Terminal or Command Prompt)\n\n```bash\ngit clone https://github.com/EmpireWorld/unity-dijkstras-pathfinding.git\n```\n\n- [Download ZIP](https://github.com/EmpireWorld/unity-dijkstras-pathfinding/archive/master.zip)\n- [Download Latest Version](https://github.com/EmpireWorld/unity-dijkstras-pathfinding/releases/latest)\n\n## Usage\n\n### Editor Usage\n\nClick on **Graph** object to use the Editor Integration.\n\n### Runtime Usage\n\nYou can use the Graph **GetShortestPath** method to get the shortest path and follow it:\n\n```csharp\nPath path = myGraph.GetShortestPath ( start, end );\nfor ( int i = 0; i \u003c path.nodes.Count; i++ ) {\n  Debug.Log ( path.nodes [i] );\n}\nDebug.LogFormat ( \"Path Length: {0}\", path.length );\n```\n\nCheck the [Follower Script](https://github.com/EmpireWorld/unity-dijkstras-pathfinding/blob/master/Assets/Scripts/Follower.cs) for usage example.\n\n## Resources\n\n[:speech_balloon: Forum Thread](https://forum.unity.com/threads/unity-dijkstras-pathfinding.505212/)\n\n## License\n\nMIT @ [Hasan Bayat](https://github.com/EmpireWorld)\n\nMade with :heart: by [Hasan Bayat](https://github.com/EmpireWorld)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhasanbayatme%2Funity-dijkstras-pathfinding","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhasanbayatme%2Funity-dijkstras-pathfinding","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhasanbayatme%2Funity-dijkstras-pathfinding/lists"}