{"id":19327623,"url":"https://github.com/cdeliens/dynamic_programming_algorithms","last_synced_at":"2026-06-11T22:31:33.352Z","repository":{"id":145392935,"uuid":"46132502","full_name":"cdeliens/dynamic_programming_algorithms","owner":"cdeliens","description":"Bellman Equation, Needleman-Warsh, Smith-Waterman Algorithms test and written in Ruby","archived":false,"fork":false,"pushed_at":"2015-12-18T19:50:07.000Z","size":8,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-11-16T22:07:14.527Z","etag":null,"topics":["bellman-equation","needleman-warsh","ruby","smith-waterman"],"latest_commit_sha":null,"homepage":"","language":"Ruby","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/cdeliens.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}},"created_at":"2015-11-13T16:11:17.000Z","updated_at":"2020-04-18T17:28:36.000Z","dependencies_parsed_at":"2023-04-13T03:31:59.497Z","dependency_job_id":null,"html_url":"https://github.com/cdeliens/dynamic_programming_algorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/cdeliens/dynamic_programming_algorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cdeliens%2Fdynamic_programming_algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cdeliens%2Fdynamic_programming_algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cdeliens%2Fdynamic_programming_algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cdeliens%2Fdynamic_programming_algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/cdeliens","download_url":"https://codeload.github.com/cdeliens/dynamic_programming_algorithms/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cdeliens%2Fdynamic_programming_algorithms/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34221150,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-11T02:00:06.485Z","response_time":57,"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":["bellman-equation","needleman-warsh","ruby","smith-waterman"],"created_at":"2024-11-10T02:17:57.174Z","updated_at":"2026-06-11T22:31:33.336Z","avatar_url":"https://github.com/cdeliens.png","language":"Ruby","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Estructuras de Datos II\nUniversidad Cenfotec, Laboratorios\n\nRuby version: ruby 2.1.2p95 or greater\n\nLab 1 y 2 Knight Tour\n* Animation could take a lot of time, I ran it more than 20 mins.\n* Board is always square.\n* Initial position x,y of the board, should be separated by a comma.\n\n```ruby\nruby knight_tour.rb \"board_size\" \"initial_position\" \"animation\"\nEx:\nruby knight_tour.rb 5 1,1 true\n```\n\nLab 3 Jenga\n* \"k\" \"p\" = random number of pieces to take.\n\n```ruby\nruby jenga.rb \"number_of_pieces\" \"k\" \"p\"\nEx:\nruby jenga.rb 8 3 6\n```\n\nLab 4 Mochila\n* weights array and values array, should be separated by a comma.\n\n```ruby\nruby mochila.rb \"capacity\" \"weights array\" \"values array\"\nEx:\nruby mochila.rb 18 5,6,7,4 85,90,150,75\n```\n\nLab 5 Needleman-Warsh\n\n```ruby\nruby needleman_warsh.rb \"gapi\" \"gape\" \"mismatch\" \"match\" \"word_a\" \"word_b\"\nEx:\nruby needleman_warsh.rb -2 -2 -1 1 \"ahora\" \"aora\"\n```\n\nLab 6 Smith-Waterman\n\n```ruby\nruby smith_waterman.rb \"gapi\" \"gape\" \"mismatch\" \"match\" \"word_a\" \"word_b\"\nEx:\nruby smith_waterman.rb -2 -2 -1 1 \"ahora\" \"aora\"\n```","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcdeliens%2Fdynamic_programming_algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcdeliens%2Fdynamic_programming_algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcdeliens%2Fdynamic_programming_algorithms/lists"}