{"id":24798837,"url":"https://github.com/tsopermon/search-algorithms-matlab-aivc","last_synced_at":"2025-03-24T22:42:02.764Z","repository":{"id":265049928,"uuid":"892158225","full_name":"tSopermon/search-algorithms-matlab-aivc","owner":"tSopermon","description":"Implementation of classical search algorithms (Uniform Cost Search, A*, Best-First Search, Breadth-First Search, and Depth-First Search) using MATLAB. The project explores blind and heuristic search techniques applied to graphs with edge costs and heuristic estimates, including applications to Bucharest city searching problem.","archived":false,"fork":false,"pushed_at":"2025-01-14T15:05:01.000Z","size":35,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-30T02:15:32.768Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"MATLAB","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/tSopermon.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-11-21T15:56:18.000Z","updated_at":"2025-01-14T15:05:05.000Z","dependencies_parsed_at":null,"dependency_job_id":"d10adfbf-8954-4255-b430-a15260a9a86f","html_url":"https://github.com/tSopermon/search-algorithms-matlab-aivc","commit_stats":null,"previous_names":["tsopermon/search-algorithms-matlab-aivc"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tSopermon%2Fsearch-algorithms-matlab-aivc","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tSopermon%2Fsearch-algorithms-matlab-aivc/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tSopermon%2Fsearch-algorithms-matlab-aivc/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tSopermon%2Fsearch-algorithms-matlab-aivc/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tSopermon","download_url":"https://codeload.github.com/tSopermon/search-algorithms-matlab-aivc/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245366198,"owners_count":20603438,"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":[],"created_at":"2025-01-30T02:15:34.861Z","updated_at":"2025-03-24T22:42:02.739Z","avatar_url":"https://github.com/tSopermon.png","language":"MATLAB","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Search Algorithms in MATLAB\n\n## Description\nThis repository contains MATLAB implementations of classical graph search algorithms:\n- Uniform Cost Search\n- A* Algorithm\n- Best-First Search\n- Breadth-First Search\n- Depth-First Search\n\nThese algorithms were implemented as part of an MSc course project on Artificial Intelligence \u0026 Machine Learning. The project demonstrates their application on two graph problems:\n1. An example graph with edge costs and heuristic estimates.\n2. A graph representing Romanian cities, where the goal is to find the shortest path to Bucharest.\n\n## Repository Structure\n- **Algorithm Scripts for the 1st example**:\n  - `search_uniform_example1.m`: Implementation of Uniform Cost Search.\n  - `search_astar_example1.m`: Implementation of the A* Algorithm.\n  - `search_bestfirst_example1.m`: Implementation of Best-First Search.\n  - `search_bfs_example1.m`: Implementation of Breadth-First Search.\n  - `search_dfs_example1.m`: Implementation of Depth-First Search.\n- **Algorithm Scripts for the 2nd example**:\n  - `search_uniform_example2.m`: Implementation of Uniform Cost Search.\n  - `search_astar_example2.m`: Implementation of the A* Algorithm.\n  - `search_bestfirst_example2.m`: Implementation of Best-First Search.\n  - `search_bfs_example2.m`: Implementation of Breadth-First Search.\n  - `search_dfs_example2.m`: Implementation of Depth-First Search.\n- **Unified Script**:\n  - `search_all_example2.m`: Unified script to run any algorithm by specifying the method at runtime.\n\n## How to Use\n1. Clone the repository:\n   ```bash\n   git clone https://github.com/tSopermon/search-algorithms-matlab-aivc.git\n   cd search-algorithms-matlab-aivc\n2. Load the MATLAB environment.\n3. To run a specific algorithm:\n   ```matlab\n   run('search_astar_example1.m');\n4. To use the unified script:\n   ```matlab\n   run('search_all_example2.m');\n\n## Features\n- Blind search techniques: Breadth-First Search and Depth-First Search.\n- Esge cost \u0026 Heuristic-based techniques: A*, Best-First Search, and Uniform Cost Search.\n- Unified script for easy switching between algorithms.\n\n## License\nThis project is licensed under the MIT License. See the `LICENSE` file for details.\n\n## Contact\nFor any inquiries or feedback, feel free to contact me at nikos.tsopanidis746@gmail.com.\n```yaml\n\n---\n\nThis organization ensures the repository is easy to navigate, well-documented, and professional. Let me know if you'd like to make further changes!\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftsopermon%2Fsearch-algorithms-matlab-aivc","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftsopermon%2Fsearch-algorithms-matlab-aivc","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftsopermon%2Fsearch-algorithms-matlab-aivc/lists"}