lambda-loop / lambda-loop/graphs
Q3 - Aula 6
Open
Nobody has claimed this yet.
- Dominant language
- C++
- Stars
- 3
- Forks
- 0
- PR merge metrics
- No merged PRs in 30d
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);
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.
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.
Assessment
- Tech stack
- cpp
- Domain
- data
- Issue type
- Feature
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Quiet
- Clarity
- Mostly clear
- Newbie friendliness
- 48/100