{"id":20266741,"url":"https://github.com/darthakiranihil/fufloyd","last_synced_at":"2026-06-07T17:32:49.648Z","repository":{"id":164896422,"uuid":"638831531","full_name":"DarthAkiraNihil/FuFloyd","owner":"DarthAkiraNihil","description":"A program to find the shortest paths in a graph, defined by its weight matrix, using Floyd Algorithm","archived":false,"fork":false,"pushed_at":"2023-05-23T06:42:44.000Z","size":31,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-14T05:13:30.103Z","etag":null,"topics":["cpp","cpp17","discrete-mathematics","example-project","floyd-algorithm","university-assignment"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/DarthAkiraNihil.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2023-05-10T07:46:42.000Z","updated_at":"2024-04-11T17:40:43.000Z","dependencies_parsed_at":"2023-12-07T17:47:22.515Z","dependency_job_id":"e8d4e112-249e-4b29-b1b3-291674b33b44","html_url":"https://github.com/DarthAkiraNihil/FuFloyd","commit_stats":null,"previous_names":["darthakiranihil/fufloyd"],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DarthAkiraNihil%2FFuFloyd","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DarthAkiraNihil%2FFuFloyd/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DarthAkiraNihil%2FFuFloyd/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DarthAkiraNihil%2FFuFloyd/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/DarthAkiraNihil","download_url":"https://codeload.github.com/DarthAkiraNihil/FuFloyd/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241746794,"owners_count":20013165,"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":["cpp","cpp17","discrete-mathematics","example-project","floyd-algorithm","university-assignment"],"created_at":"2024-11-14T12:11:13.517Z","updated_at":"2025-03-03T22:10:43.285Z","avatar_url":"https://github.com/DarthAkiraNihil.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# FuFloyd\nThis is a program to find the shortest paths in a graph, defined by its weight matrix\n\n## The functional\nThe program is able to apply Floyd Algorithm to graphs, defined in:\n* A weight matrix that's been entered in the program\n* A weight matrix that's in a text file\n\n## License\nThis project is licensed under Apache 2.0 license\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdarthakiranihil%2Ffufloyd","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdarthakiranihil%2Ffufloyd","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdarthakiranihil%2Ffufloyd/lists"}