{"id":20698243,"url":"https://github.com/urbanclimatefr/breadth-first-search","last_synced_at":"2025-10-19T14:05:59.443Z","repository":{"id":261244257,"uuid":"495012580","full_name":"urbanclimatefr/Breadth-First-Search","owner":"urbanclimatefr","description":"Implement the graph search version of breadth-first search in Java","archived":false,"fork":false,"pushed_at":"2022-05-24T07:11:45.000Z","size":96,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-11T03:40:18.304Z","etag":null,"topics":["bfs-algorithm","breath-first-search","java","vacuum-cleaner"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/urbanclimatefr.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":"2022-05-22T09:20:49.000Z","updated_at":"2023-03-05T08:10:36.000Z","dependencies_parsed_at":"2024-11-05T14:38:37.288Z","dependency_job_id":null,"html_url":"https://github.com/urbanclimatefr/Breadth-First-Search","commit_stats":null,"previous_names":["urbanclimatefr/breadth-first-search"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/urbanclimatefr/Breadth-First-Search","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/urbanclimatefr%2FBreadth-First-Search","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/urbanclimatefr%2FBreadth-First-Search/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/urbanclimatefr%2FBreadth-First-Search/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/urbanclimatefr%2FBreadth-First-Search/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/urbanclimatefr","download_url":"https://codeload.github.com/urbanclimatefr/Breadth-First-Search/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/urbanclimatefr%2FBreadth-First-Search/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":260684152,"owners_count":23046099,"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":["bfs-algorithm","breath-first-search","java","vacuum-cleaner"],"created_at":"2024-11-17T00:23:51.664Z","updated_at":"2025-10-19T14:05:59.345Z","avatar_url":"https://github.com/urbanclimatefr.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Breadth-First Search\n\nImplement the graph search version of breadth-first search (as described in AIMA Chapter 3 Section 3.4.1) in Java to solve the small problem described below. The implementation does not need to be a generic breadth-first search, it can be specific to this problem. In particular, a state may be represented with a single integer, and the expansion of a node can be implemented with a simple look-up table, indexed by an integer s and containing a list of integers (representing the states adjacent to s).\n\nThe problem scenario is the vacuum world. The diagram of all 8 states is shown below. Each state has a number in red. You will need to represent the states and transitions shown in the diagram in your program in some form. For example, state 1 expands to states 1, 2 and 3 (by the actions Left, Right and Suck).\n\nNote:  AIMA refers to Artificial Intelligence: A Modern Approach, by Stuart Russell and Peter Norvig \n\n![image](https://user-images.githubusercontent.com/60503179/169688495-def48632-72a4-4e7b-9b32-e3e6e1da0f34.png)\nFig. 1. State diagram. \n\nThe initial state is state 1, and the goal states are 7 and 8.\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Furbanclimatefr%2Fbreadth-first-search","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Furbanclimatefr%2Fbreadth-first-search","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Furbanclimatefr%2Fbreadth-first-search/lists"}