{"id":23291264,"url":"https://github.com/tomasjohansson/adapters-shortest-paths-dotnet","last_synced_at":"2025-09-08T08:42:28.602Z","repository":{"id":69668822,"uuid":"154889813","full_name":"TomasJohansson/adapters-shortest-paths-dotnet","owner":"TomasJohansson","description":"Adapters for C# implementations finding the shortest paths between two locations. This is useful for travel routing when you want to minimize the total time or total distance. ","archived":false,"fork":false,"pushed_at":"2024-07-08T14:28:19.000Z","size":1558,"stargazers_count":4,"open_issues_count":1,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2024-12-05T23:07:53.798Z","etag":null,"topics":["k-shortest-paths","kshortestpaths","shortest-path-algorithm","shortest-paths-algorithm","shortest-route","shortest-routes","travel-routes","travel-routing","yen","yen-algorithm","yenalgorithm"],"latest_commit_sha":null,"homepage":"","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/TomasJohansson.png","metadata":{},"created_at":"2018-10-26T20:18:32.000Z","updated_at":"2024-11-27T21:43:56.000Z","dependencies_parsed_at":null,"dependency_job_id":"ad5585b4-94b4-435f-98a1-e0d9cd2fb176","html_url":"https://github.com/TomasJohansson/adapters-shortest-paths-dotnet","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/TomasJohansson%2Fadapters-shortest-paths-dotnet","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TomasJohansson%2Fadapters-shortest-paths-dotnet/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TomasJohansson%2Fadapters-shortest-paths-dotnet/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TomasJohansson%2Fadapters-shortest-paths-dotnet/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/TomasJohansson","download_url":"https://codeload.github.com/TomasJohansson/adapters-shortest-paths-dotnet/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":230537071,"owners_count":18241519,"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":["k-shortest-paths","kshortestpaths","shortest-path-algorithm","shortest-paths-algorithm","shortest-route","shortest-routes","travel-routes","travel-routing","yen","yen-algorithm","yenalgorithm"],"created_at":"2024-12-20T05:16:28.028Z","updated_at":"2024-12-20T05:16:28.704Z","avatar_url":"https://github.com/TomasJohansson.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":null,"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftomasjohansson%2Fadapters-shortest-paths-dotnet","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftomasjohansson%2Fadapters-shortest-paths-dotnet","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftomasjohansson%2Fadapters-shortest-paths-dotnet/lists"}