A5
Nobody has claimed this yet.
Assessment
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Newbie friendliness
- 45/100
Research direction
Start by locating the C++ graph representation and the code or entry points for GRAFO1 and GRAFO2. Read how vertices and edges are stored, then determine the expected degree result for each vertex in both graphs. Done means the requested function calculates and exposes the degree of every vertex for both inputs.
Written by the indexing model from the issue text.
Description
Função que calcula o grau de cada vértice (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
-
AuTest Bug Tests
Difficulty 2/5 1-3 hours Newbie friendliness 78/100
apache/trafficserver#13714 ·
-
bug build
Difficulty 2/5 1-3 hours Newbie friendliness 88/100
facebookincubator/velox#19143 ·
-
Difficulty 2/5 1-3 hours Newbie friendliness 82/100
-
Difficulty 2/5 1-3 hours Newbie friendliness 68/100
tenstorrent/tt-metal#57393 · 1 comment ·
-
Difficulty 2/5 1-3 hours Newbie friendliness 76/100
objectionary/eo-graphs#74 ·