lambda-loop / lambda-loop/graphs
A7
Open
Nobody has claimed this yet.
trabalho1
- Dominant language
- C++
- Stars
- 3
- Forks
- 0
- PR merge metrics
- No merged PRs in 30d
Description
Função que determina o total de vértices (GRAFO1, GRAFO2)
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
The issue provides no file or test path; start by locating the definitions and uses of GRAFO1 and GRAFO2 in the repository. Determine the expected vertex-counting entry point and verify that it returns the total number of vertices for both graph representations.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- data
- Issue type
- Feature
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Quiet
- Clarity
- Needs clarification
- Newbie friendliness
- 42/100