A7
Nobody has claimed this yet.
Assessment
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Newbie friendliness
- 42/100
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.
Description
Função que determina o total de vértices (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
-
ai_reviewed
Difficulty 2/5 1-3 hours Newbie friendliness 68/100
ydb-platform/ydb#53869 · 3 comments ·
-
bug cert blocker needs triage
Difficulty 2/5 1-3 hours Newbie friendliness 82/100
project-chip/connectedhomeip#74373 ·
-
upstream update
Difficulty 2/5 1-3 hours Newbie friendliness 75/100
conan-io/conan-center-index#31035 ·
-
Bug
Difficulty 2/5 1-3 hours Newbie friendliness 68/100
-
documentation
Difficulty 1/5 Under an hour Newbie friendliness 85/100
vllm-project/vllm-ascend#17329 ·