{"id":21560841,"url":"https://github.com/muhammadmoeezkhan/euclidean-distances","last_synced_at":"2026-04-20T10:06:31.466Z","repository":{"id":124315057,"uuid":"549143150","full_name":"MuhammadMoeezKhan/Euclidean-Distances","owner":"MuhammadMoeezKhan","description":"Python Program That Calculates Euclidean Distances Via 5 Algorithms","archived":false,"fork":false,"pushed_at":"2022-10-12T04:04:22.000Z","size":22,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-18T04:34:17.688Z","etag":null,"topics":["numpy","pandas-python","scipy","timeit"],"latest_commit_sha":null,"homepage":"","language":"Python","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/MuhammadMoeezKhan.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":"2022-10-10T18:37:13.000Z","updated_at":"2022-10-12T04:02:05.000Z","dependencies_parsed_at":null,"dependency_job_id":"0c84b05c-cef6-45d5-b4a7-5bb91b22c901","html_url":"https://github.com/MuhammadMoeezKhan/Euclidean-Distances","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/MuhammadMoeezKhan/Euclidean-Distances","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MuhammadMoeezKhan%2FEuclidean-Distances","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MuhammadMoeezKhan%2FEuclidean-Distances/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MuhammadMoeezKhan%2FEuclidean-Distances/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MuhammadMoeezKhan%2FEuclidean-Distances/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MuhammadMoeezKhan","download_url":"https://codeload.github.com/MuhammadMoeezKhan/Euclidean-Distances/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MuhammadMoeezKhan%2FEuclidean-Distances/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32042336,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-20T00:18:06.643Z","status":"online","status_checked_at":"2026-04-20T02:00:06.527Z","response_time":94,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["numpy","pandas-python","scipy","timeit"],"created_at":"2024-11-24T09:17:29.762Z","updated_at":"2026-04-20T10:06:31.457Z","avatar_url":"https://github.com/MuhammadMoeezKhan.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Euclidean Distances\n\n#### Euclidean distance measures are central to the k-Nearest Neighbor algorithm, thus this project utilizes *5* algorithims to calculate distance point value differences and each algorithim's detailed numerical complexity analysis!\n\n### Project Utilizes:\n- Pandas\n  - Series/Dataframes\n  - Loaded Operators\n  - Higher Order functions\n- NumPy\n  - linalg module\n- SciPy \n  - distance module\n- Timeit\n  -  default_timer() method\n\n### Project Features:\n- Project delves into several different ways to compute the Euclidean distance between two points. \n- Different algorithms are timed to help determine which method of computing Euclidean distance is the most efficient.\n- Algorithm iterations to visualize the impact on the algorithm's duration.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmuhammadmoeezkhan%2Feuclidean-distances","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmuhammadmoeezkhan%2Feuclidean-distances","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmuhammadmoeezkhan%2Feuclidean-distances/lists"}