{"id":18511678,"url":"https://github.com/sondosaabed/max-led-lighting","last_synced_at":"2025-04-22T15:43:18.269Z","repository":{"id":147490964,"uuid":"465898854","full_name":"sondosaabed/Max-LED-Lighting","owner":"sondosaabed","description":"Find optimal number of maximum leds that can be powered using 2 dimentional dynamic programming","archived":false,"fork":false,"pushed_at":"2023-03-16T21:26:20.000Z","size":1114,"stargazers_count":9,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-29T16:34:21.328Z","etag":null,"topics":["dynamic-programming","java","javafx-application","leds","longest-common-subsequence"],"latest_commit_sha":null,"homepage":"","language":"Java","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/sondosaabed.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":"2022-03-03T22:03:49.000Z","updated_at":"2024-12-30T01:33:47.000Z","dependencies_parsed_at":null,"dependency_job_id":"0646f099-1165-4da1-bd6d-e7dab2372693","html_url":"https://github.com/sondosaabed/Max-LED-Lighting","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/sondosaabed%2FMax-LED-Lighting","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sondosaabed%2FMax-LED-Lighting/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sondosaabed%2FMax-LED-Lighting/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sondosaabed%2FMax-LED-Lighting/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sondosaabed","download_url":"https://codeload.github.com/sondosaabed/Max-LED-Lighting/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":250270211,"owners_count":21403009,"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":["dynamic-programming","java","javafx-application","leds","longest-common-subsequence"],"created_at":"2024-11-06T15:29:22.825Z","updated_at":"2025-04-22T15:43:18.247Z","avatar_url":"https://github.com/sondosaabed.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Max LED Lighting\nThis is a Java desktop application. Two circuit boards (S and L), where S contains n power sources, while L contains LEDs n are given. The source S sorted in ascending order \u003c1, 2, 3, … , n\u003e, while the LEDs on L are not \u003c2, 9, 5, 14, 3...\u003e. The app connects each LED in L to its pair in S (i.e., 1 with 1, 2 with 2) through unshielded wires, thus when a wire connects a LED (li) in L with its corresponding source in S (si), it may prevent other LEDs from being connected (no two wires may cross).\n\nExample as below, if you connected l1 with s1, then 3 LEDs maximum will be lightened.\n![00](https://user-images.githubusercontent.com/65151701/156570554-54e7f1f9-93fd-4c83-82cb-e71031e22366.png)\n\nIn this project I used JavaFX For User Graphical inteface. Applied Longest Common Subsequence algorithm as a dynamic solution. This project is built as an assignment for Algorithm course.\n\n# Running the project \nIn order to run the project, needs the JavaFx library to be build on the projecet path. \nThe input of the program is: \nn (number of LEDs, say 100).\nA permutation of numbers (\u003c1 to n\u003e) :the ordering of the LEDs on the board L. \n\nFile format example\n6 \n2 6 3 5 4 1 \n\n# Screenshots of Application\nBrowse for input file:\n![1](https://user-images.githubusercontent.com/65151701/156570869-06ffae91-885d-41b4-b41e-851a0e158140.png)\n\nReady to run app:\n![2](https://user-images.githubusercontent.com/65151701/156570961-349ba63c-8cb6-4037-a9cc-66316c726fb2.png)\n\nNumber of LEDs:\n![3](https://user-images.githubusercontent.com/65151701/156571079-e049f09f-aebb-4c53-bf45-8880cc33a1a6.png)\n\nShow board of LEDs:\n![4](https://user-images.githubusercontent.com/65151701/156571177-97585c13-4b27-4224-8b6d-81124e6bf845.png)\n\nConnect the LEDS based on Maximum: \n![5](https://user-images.githubusercontent.com/65151701/156571349-6d31e960-1fca-4388-ac6c-a95d0ea988d1.png)\n\nDynamic table to get the optimal solution:\n![6](https://user-images.githubusercontent.com/65151701/156571637-3db39bce-ca67-4399-8575-1702bfb71d53.png)\n\nAnother input for 10 LEDs:\n![7](https://user-images.githubusercontent.com/65151701/156571855-de45d01a-c544-4624-8904-25d150751b82.png)\n\nDynamic table for 10 LEDs:\n![8](https://user-images.githubusercontent.com/65151701/156571859-e499fb4b-916c-42a3-beb4-744ad3084388.png)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsondosaabed%2Fmax-led-lighting","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsondosaabed%2Fmax-led-lighting","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsondosaabed%2Fmax-led-lighting/lists"}