Q3 - Aula 6
Nobody has claimed this yet.
Assessment
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Newbie friendliness
- 48/100
Research direction
Start by locating the graph representation and the entry point for the Aula 6 exercise. Read how adjacency lists and vertices are represented, then implement the requested breadth-first search and verify that the recorded order matches the order vertices leave the queue.
Written by the indexing model from the issue text.
Description
- Implemente o algoritmo para a busca em largura com lista de adjacência e a ordem em que o vértice
foi retirado da fila (largura de v);
- 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