{"id":26536911,"url":"https://github.com/drummerviswa/ai_project_implementation","last_synced_at":"2025-10-09T02:28:14.279Z","repository":{"id":283317480,"uuid":"951372673","full_name":"drummerviswa/AI_Project_Implementation","owner":"drummerviswa","description":"AI Project - Implementation of Searching Algorithm (Uninformed Search).","archived":false,"fork":false,"pushed_at":"2025-03-19T15:44:21.000Z","size":25,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"viswa","last_synced_at":"2025-03-19T16:35:50.547Z","etag":null,"topics":["ai","artificial-intelligence","c","cprogramming","search","searching-algorithms"],"latest_commit_sha":null,"homepage":"","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/drummerviswa.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":"2025-03-19T15:18:45.000Z","updated_at":"2025-03-19T15:48:42.000Z","dependencies_parsed_at":"2025-03-19T16:46:59.244Z","dependency_job_id":null,"html_url":"https://github.com/drummerviswa/AI_Project_Implementation","commit_stats":null,"previous_names":["drummerviswa/ai_project_implementation"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/drummerviswa/AI_Project_Implementation","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/drummerviswa%2FAI_Project_Implementation","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/drummerviswa%2FAI_Project_Implementation/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/drummerviswa%2FAI_Project_Implementation/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/drummerviswa%2FAI_Project_Implementation/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/drummerviswa","download_url":"https://codeload.github.com/drummerviswa/AI_Project_Implementation/tar.gz/refs/heads/viswa","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/drummerviswa%2FAI_Project_Implementation/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279000781,"owners_count":26082906,"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","status":"online","status_checked_at":"2025-10-09T02:00:07.460Z","response_time":59,"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":["ai","artificial-intelligence","c","cprogramming","search","searching-algorithms"],"created_at":"2025-03-21T22:17:37.058Z","updated_at":"2025-10-09T02:28:14.258Z","avatar_url":"https://github.com/drummerviswa.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# AI Project - Implementation of Searching Algorithm (Uninformed Search)\r\n\r\nThis project implements **Depth-Limited Search (DLS)** and **Iterative Deepening Search (IDS)** as part of **Uninformed Search Algorithms** in **Artificial Intelligence**. The implementation follows concepts from **Tim Jones.M**.\r\n\r\n---\r\n\r\n## 📌 Features\r\n- Graph implementation using an adjacency matrix.\r\n- Stack-based **Depth-Limited Search (DLS)**.\r\n- **Iterative Deepening Search (IDS)** for better goal reachability.\r\n- Supports adding and searching for edges.\r\n- Dynamically allocated memory for flexibility.\r\n\r\n---\r\n\r\n## 📁 File Structure\r\n```\r\n/project-folder\r\n    ├── graph.h      # Header file for graph functions\r\n    ├── graph.c      # Implementation of graph functions\r\n    ├── stack.h      # Header file for stack operations\r\n    ├── stack.c      # Implementation of stack functions\r\n    ├── main.c       # Main program (DLS \u0026 IDS implementation)\r\n    ├── README.md    # Project documentation\r\n```\r\n\r\n---\r\n\r\n## 🚀 How to Compile and Run\r\n\r\n### **1. Compile the project**\r\n```sh\r\ngcc main.c graph.c stack.c -o search_program\r\n```\r\n\r\n### **2. Run the program**\r\n```sh\r\n./search_program\r\n```\r\n\r\n---\r\n\r\n## 🛠 Implementation Details\r\n\r\n### **Graph Representation**\r\nThe graph is represented as an **adjacency matrix**, where each edge has a weight.\r\n\r\n### **Stack Implementation**\r\nA stack is used for Depth-First traversal.\r\n\r\n### **Depth-Limited Search (DLS)**\r\nDLS is a depth-first search with a **maximum depth limit** to avoid infinite recursion in cyclic graphs.\r\n\r\n### **Iterative Deepening Search (IDS)**\r\nIDS combines the advantages of depth-first and breadth-first search by repeatedly running DLS with increasing depth limits until the goal is found.\r\n\r\n---\r\n\r\n## 📝 Example Output\r\nFor `dls(g_p, 0, 5, 2);`, the output will be:\r\n```sh\r\n0 (depth 0)\r\n2 (depth 1)\r\n5 (depth 2)\r\nGoal node 5 found at depth 2\r\n```\r\nFor `ids(g_p, 0, 5);`, the output will be:\r\n```sh\r\nTrying depth limit: 0\r\nTrying depth limit: 1\r\nTrying depth limit: 2\r\nGoal node 5 found at depth 2\r\n```\r\n\r\n---\r\n\r\n## 📖 Reference\r\nThis project is based on concepts from **Tim Jones.M - Artificial Intelligence: Search Algorithms and Applications**.\r\n\r\n---\r\n\r\n## 📜 License\r\nThis project is **open-source** under the MIT License.\r\n\r\n---\r\n\r\n## 🤝 Contributing\r\nFeel free to **fork** this repo, add new search algorithms, and submit a **pull request**! 🚀\r\n\r\n### Suggested Contributions:\r\n- Implement **Breadth-First Search (BFS)**\r\n- Implement **Depth-First Search (DFS)**\r\n- Implement **A* Search Algorithm**\r\n- Implement **Hill Climbing Algorithm**\r\n- Implement **Tabu Search**\r\n- Add test cases and performance benchmarks\r\n- Improve memory efficiency and optimization\r\n\r\nYour contributions will help enhance the project and make it a valuable resource for AI search algorithms! 🔥","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdrummerviswa%2Fai_project_implementation","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdrummerviswa%2Fai_project_implementation","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdrummerviswa%2Fai_project_implementation/lists"}