{"id":18327911,"url":"https://github.com/thekamik/searching-algorithms","last_synced_at":"2025-10-04T14:15:04.380Z","repository":{"id":254564279,"uuid":"846919009","full_name":"thekamik/searching-algorithms","owner":"thekamik","description":"Implementing Dijkstra, Bellman-Ford, and A* algorithms in C++","archived":false,"fork":false,"pushed_at":"2024-12-01T19:56:30.000Z","size":77,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-15T10:15:47.269Z","etag":null,"topics":["a-star-algorithm","bellman-ford-algorithm","cpp","dijkstra-algorithm","graphs","graphs-algorithms","search-algorithm"],"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/thekamik.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,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-08-24T10:22:23.000Z","updated_at":"2024-12-01T19:56:33.000Z","dependencies_parsed_at":"2024-12-23T12:28:12.027Z","dependency_job_id":"17000117-d192-46cd-a390-bfe6187ead66","html_url":"https://github.com/thekamik/searching-algorithms","commit_stats":null,"previous_names":["thekamik/searching-algorithms"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thekamik%2Fsearching-algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thekamik%2Fsearching-algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thekamik%2Fsearching-algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thekamik%2Fsearching-algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/thekamik","download_url":"https://codeload.github.com/thekamik/searching-algorithms/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248072052,"owners_count":21043151,"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":["a-star-algorithm","bellman-ford-algorithm","cpp","dijkstra-algorithm","graphs","graphs-algorithms","search-algorithm"],"created_at":"2024-11-05T19:12:37.107Z","updated_at":"2025-10-04T14:14:59.360Z","avatar_url":"https://github.com/thekamik.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Search Algorithms Implementation\n\nThis project provides an implementation of several fundamental search algorithms in C++. The algorithms included are:\n\n- **Dijkstra's Algorithm**: Finds the shortest paths from a single source vertex to all other vertices in a weighted graph with non-negative edge weights.\n- **Bellman-Ford Algorithm**: Computes the shortest paths from a single source vertex to all other vertices in a graph that may contain negative edge weights.\n- **A-star Algorithm**: Finds the shortest path between nodes using heuristics to improve efficiency in pathfinding.\n\n## Project Description\n\nThis repository contains code that is designed to be easily integrated into other projects. The primary component is the graph-related functionality, which can be seamlessly added to your own codebase.\n\n## Project Structure\n```\nSEARCHING-ALGORITHMS/\n├── example/\n│   └── main.cpp           # Example program demonstrating searching algorithms\n├── include/\n│   ├── graph.h            # Header file for the graph implementation\n│   └── node.h             # Header file for the node implementation\n├── src/\n│   ├── graph.cpp          # Implementation of the graph\n│   └── node.cpp           # Implementation of the node\n├── CMakeLists.txt         # CMake build configuration\n└── run.ps1                # PowerShell script to automate the build and execution\n```\n\n### Example\n\nRefer to the `main.cpp` file in this repository for a practical example of how to use the code.\n\n## Features\n\n- **CMake Support**: The project uses CMake for build configuration and management.\n- **Direct Compilation**: You can also compile the project directly using the provided `g++` command.\n- **Designed as Library**: The project is structured to function as a reusable library.\n    \n## Usage\nAfter compilation, you can run the main.exe to execute the search algorithms. Ensure that all necessary source files are in the appropriate directories.\n\n## Contributing\nFeel free to contribute to this project by submitting issues or pull requests. Your contributions are welcome!\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthekamik%2Fsearching-algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fthekamik%2Fsearching-algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthekamik%2Fsearching-algorithms/lists"}