{"id":13528663,"url":"https://github.com/Dannark/FlameExamples","last_synced_at":"2025-04-01T14:32:41.624Z","repository":{"id":123520832,"uuid":"288209163","full_name":"Dannark/FlameExamples","owner":"Dannark","description":"Example of algorithms in dart/flutter","archived":false,"fork":false,"pushed_at":"2020-09-11T23:08:28.000Z","size":7,"stargazers_count":17,"open_issues_count":0,"forks_count":3,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-11-02T15:35:37.571Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Dart","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/Dannark.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}},"created_at":"2020-08-17T14:57:00.000Z","updated_at":"2024-10-03T01:00:27.000Z","dependencies_parsed_at":"2024-01-03T03:54:45.110Z","dependency_job_id":"67dfa7b8-2893-475b-86c4-f507781176e5","html_url":"https://github.com/Dannark/FlameExamples","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Dannark%2FFlameExamples","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Dannark%2FFlameExamples/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Dannark%2FFlameExamples/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Dannark%2FFlameExamples/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Dannark","download_url":"https://codeload.github.com/Dannark/FlameExamples/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246655202,"owners_count":20812597,"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":"2024-08-01T07:00:22.471Z","updated_at":"2025-04-01T14:32:41.345Z","avatar_url":"https://github.com/Dannark.png","language":"Dart","funding_links":[],"categories":["Articles \u0026 Tutorials"],"sub_categories":["Examples"],"readme":"### Exmaples\n    * Smooth Camera Follow\n    * Maze generation algorithm\n\n## Maze generation algorithm\n![maze_algo](https://user-images.githubusercontent.com/7622553/92973337-5e076b80-f45a-11ea-87b1-2a25c47fcfb0.gif)\n\nThis algorithm is `recursive division method` to get a perfect maze. All the areas inside of it are reachable.\nEach time, it will divide the areas called `chambers` in two smaller areas and will keep the proccess until all chambers are minimum sized. \n\nThis is a modified version, The original algorithm was made by [xabi](https://xa.bi/)\n\n### Instructions\nTo use it just call \n```\n    var width = 41;\n    var height = 41;\n    List walls = RecursiveMaze()\n        .build(width, height, orientationType: OrientationType.randomized);\n```\n\nYou can see the demo in `examples/maze.dart`","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FDannark%2FFlameExamples","html_url":"https://awesome.ecosyste.ms/projects/github.com%2FDannark%2FFlameExamples","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FDannark%2FFlameExamples/lists"}