A13
Nobody has claimed this yet.
Assessment
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Newbie friendliness
- 35/100
Research direction
Start by locating the graph implementation and the GRAFO1 and GRAFO3 examples mentioned in the issue. Determine how an initial vertex is represented, then add breadth-first search from a selected vertex and verify traversal results for those graphs.
Written by the indexing model from the issue text.
Description
Busca em largura, a partir de um vértice específico (GRAFO1, GRAFO3, Vértice inicial)
- 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 ·