{"id":23602798,"url":"https://github.com/andreirech/graphsequencefinder","last_synced_at":"2025-11-05T06:30:38.772Z","repository":{"id":242781158,"uuid":"810547225","full_name":"AndreiRech/GraphSequenceFinder","owner":"AndreiRech","description":"📦 Finds the longest nesting sequence in a graph of boxes, determining the maximum depth of nesting","archived":false,"fork":false,"pushed_at":"2024-06-19T23:26:13.000Z","size":128,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-12-27T12:13:13.973Z","etag":null,"topics":["algorithms","graph","java"],"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/AndreiRech.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":"2024-06-04T22:58:52.000Z","updated_at":"2024-09-08T23:46:46.000Z","dependencies_parsed_at":"2024-06-20T04:10:25.606Z","dependency_job_id":null,"html_url":"https://github.com/AndreiRech/GraphSequenceFinder","commit_stats":null,"previous_names":["andreirech/graphsequencefinder"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AndreiRech%2FGraphSequenceFinder","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AndreiRech%2FGraphSequenceFinder/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AndreiRech%2FGraphSequenceFinder/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AndreiRech%2FGraphSequenceFinder/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AndreiRech","download_url":"https://codeload.github.com/AndreiRech/GraphSequenceFinder/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239449583,"owners_count":19640535,"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":["algorithms","graph","java"],"created_at":"2024-12-27T12:13:18.252Z","updated_at":"2025-11-05T06:30:38.728Z","avatar_url":"https://github.com/AndreiRech.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 🔖 ALUNOS\n\n- [Andrei Rech | 23102140](https://github.com/AndreiRech)  \n- [Eduardo Colla De Bastiani | 23106295](https://github.com/eduardo-de-bastiani)\n\n# 📚 INTRODUÇÃO\n\nPrograma capaz de encontrar a maior sequência possível de objetos colocáveis um dentro de outro dada três dimenções não identificadas.\n\u003e A partir de casos testes, encontrar a **maior sequência** dentro de um grafo\n\nCaso deseje, é de grande ajuda utilizar o [Simulador de Caixas](https://www.inf.pucrs.br/flash/boxes-html/) para entender melhor como funciona a problemática.\n\n# 🛠 PRÉ REQUISITOS\n\nÉ necessário possuir a linguagem [Java](https://www.java.com/pt-BR/download/) instalada no computador.\n\nTambém, a utilização de um **editor de código**, como o [VSCode](https://code.visualstudio.com/) facilita a utilização do programa.\n\n# ⚙ INICIALIZAÇÃO\n\nDentro do diretório do programa, compile o mesmo utilizando:\n\n```\njavac Main.java Box.java Graph.java Digraph.java DFS.java\n```\n\nApós isso, execute-o:\n\n```\njava Main\n```\n\nCaso arquivos .class sejam gerados, é possível excluí-los usando:\n\n*Windows*\n```\ndel *.class\n```\n\n*Linux | Mac*\n```\nrm *.class\n```\n\n# O QUE FAZER\n\n**DESENVOLVIMENTO DA SOLUÇÃO**\n\n- [X] Verificar se uma caixa cabe dentro de outra\n- [ ] Encontrar o maior caminho entre elas\n\n**FUNÇÕES SUPORTES**\n\n- [X] Leitura do arquivo\n- [X] Criação da representação gráfica *.dot é printado após achar o caminho | opcional*\n- [X] Temporizar resultados\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fandreirech%2Fgraphsequencefinder","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fandreirech%2Fgraphsequencefinder","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fandreirech%2Fgraphsequencefinder/lists"}