lambda-loop / lambda-loop/graphs
Q2 - Aula 6
Open
Nobody has claimed this yet.
- Dominant language
- C++
- Stars
- 3
- Forks
- 0
- PR merge metrics
- No merged PRs in 30d
Description
- Implemente o algoritmo para a busca em largura com arestas de retorno e classificando as arestas
como pai, tio, irmão ou primo;
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by inspecting the repository's graph representation and existing traversal entry points, since the issue names no files or tests. Implement breadth-first search with back edges and classify edges as parent, uncle, sibling, or cousin. Done means the traversal and all requested classifications are present and verifiable in the project's existing usage or checks.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- data
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Quiet
- Clarity
- Needs clarification
- Newbie friendliness
- 35/100