A8
Nobody has claimed this yet.
Assessment
- Difficulty
- 2/5
- Estimated time
- 1-3 hours
- Newbie friendliness
- 58/100
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.
Description
Função que determina o número total de arestas (GRAFO1, GRAFO2)
- Dominant language
- C++
- Stars
- 3
- Forks
- 0
- PR merge metrics
- No merged PRs in 30d
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.
More from lambda-loop/graphs
-
B21 (Opcional) Opentrabalho1
Difficulty 4/5 3-5 days Newbie friendliness 35/100
lambda-loop/graphs#35 ·
-
B20 Opentrabalho1
Difficulty 3/5 1-2 days Newbie friendliness 55/100
lambda-loop/graphs#34 ·
-
B19 (Opcional) Opentrabalho1
Difficulty 3/5 1-2 days Newbie friendliness 45/100
lambda-loop/graphs#33 ·
-
B18 (Opcional) Opentrabalho1
Difficulty 5/5 Over a week Newbie friendliness 25/100
lambda-loop/graphs#32 ·
-
B17 Opentrabalho1
Difficulty 4/5 3-5 days Newbie friendliness 35/100
lambda-loop/graphs#31 ·
All issues in lambda-loop/graphs
Similar issues
-
Difficulty 2/5 1-3 hours Newbie friendliness 76/100
objectionary/eo-graphs#74 ·
-
Difficulty 1/5 Under an hour Newbie friendliness 95/100
-
enhancement
Difficulty 1/5 Under an hour Newbie friendliness 88/100
QuantStack/git2cpp#187 ·
-
Difficulty 2/5 1-3 hours Newbie friendliness 86/100
-
Difficulty 2/5 1-3 hours Newbie friendliness 72/100