lambda-loop / lambda-loop/graphs
B18 (Opcional)
Open
Nobody has claimed this yet.
trabalho1
- Dominant language
- C++
- Stars
- 3
- Forks
- 0
- PR merge metrics
- No merged PRs in 30d
Description
Determinação de Grafo subjacente (Opcional = 0.5 ponto) (DIGRAFO1)
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
No file, test, or entry point is named in the issue. Start by reading the repository structure and any project instructions to find where graph operations are implemented; before coding, clarify the expected input, output, and meaning of “grafo subjacente.” Done requires an agreed specification and a verifiable implementation.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- data
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Quiet
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100