{"id":19691813,"url":"https://github.com/radd/dijkstra-tests","last_synced_at":"2026-04-08T16:01:50.820Z","repository":{"id":153052510,"uuid":"199433860","full_name":"radd/dijkstra-tests","owner":"radd","description":"Testing the performance of a programming language based on the Dijkstra's Algorithm.","archived":false,"fork":false,"pushed_at":"2019-07-29T10:46:08.000Z","size":787,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-27T11:39:10.307Z","etag":null,"topics":["c","cpp","csharp","java","javascript","python"],"latest_commit_sha":null,"homepage":null,"language":"C++","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/radd.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-07-29T10:45:20.000Z","updated_at":"2019-07-29T10:47:28.000Z","dependencies_parsed_at":null,"dependency_job_id":"82d84fb5-b3cb-48db-b86e-a1ff1da575a0","html_url":"https://github.com/radd/dijkstra-tests","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/radd/dijkstra-tests","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/radd%2Fdijkstra-tests","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/radd%2Fdijkstra-tests/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/radd%2Fdijkstra-tests/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/radd%2Fdijkstra-tests/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/radd","download_url":"https://codeload.github.com/radd/dijkstra-tests/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/radd%2Fdijkstra-tests/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31562697,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-08T14:31:17.711Z","status":"ssl_error","status_checked_at":"2026-04-08T14:31:17.202Z","response_time":54,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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":["c","cpp","csharp","java","javascript","python"],"created_at":"2024-11-11T19:11:08.876Z","updated_at":"2026-04-08T16:01:50.801Z","avatar_url":"https://github.com/radd.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# dijkstra-tests\n\nTesting the performance of a programming language based on the Dijkstra's Algorithm.\n\nDijkstra's Algorithm is an algorithm for finding the shortest paths between two nodes in a graph. In this project, the algorithm has been modified to find shortest paths between all nodes in a graph. This provides higher CPU load, so it's easier to test language performance.\n\n### Programming languages:\n\n- C\n- C++\n- C#\n- Java\n- JavaScript (Node.js)\n- Python (PyPy3)\n\n### Graphs:\n\n4 types of graphs have been created for this project:\n\n- 10 nodes\n- 100 nodes\n- 200 nodes\n- 300 nodes\n\n#### Example:\n200 nodes\n\n\u003cimg src=\"https://radd.github.io/other/images/dijkstra/1.png\" width=\"600\" \u003e\n\n[See graph online](https://graphonline.ru/en/?graph=mwGnsEwHTCYRYMcl)\n\n## Build\n\nOpen specific language folder, go to build and execute cmd.bat file\n\n```bash\ncd java\ncd build\n.\\cmd.bat\n```\n\n## Run all tests with specific nodes\n\n```bash\n.\\testResult.ps1 $size $from $to\n```\n\nWhere:\n- $size is graph size\n- $from is start node\n- $to is end node\n\n## Run all tests\n\n```bash\n.\\runAllTests.ps1 $size\n```\n\nWhere:\n- $size is graph size\n\n## Output\n\nTest results are saved to **output.txt** file\n\n\n### Example for Java:\n\n```bash\n01 June 2018 10:57:44\n---------------------- J A V A ------------------------\nGraf 100\n313\n328\n313\n328\n312\n\nGraf 200\n4016\n4141\n5890\n3829\n4594\n\nGraf 300\n23750\n24188\n21532\n24563\n21563\n```","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fradd%2Fdijkstra-tests","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fradd%2Fdijkstra-tests","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fradd%2Fdijkstra-tests/lists"}