lambda-loop / lambda-loop/graphs
A8
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 número total de arestas (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
Start by locating the GRAFO1 and GRAFO2 definitions and the entry point where graph operations are implemented. Determine how each graph stores its edges, then verify that the new function reports the total edge count for both graph representations.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- data
- Issue type
- Feature
- Difficulty
- 2/5
- Estimated time
- 1-3 hours
- Activity status
- Quiet
- Clarity
- Mostly clear
- Newbie friendliness
- 58/100