lambda-loop / lambda-loop/graphs
B21 (Opcional)
Open
Nobody has claimed this yet.
trabalho1
- Dominant language
- C++
- Stars
- 3
- Forks
- 0
- PR merge metrics
- No merged PRs in 30d
Description
Pesquisar e implementar uma aplicação, usando busca em profundidade (Opcional = 1 ponto) (em exemplo definido pelo grupo, com pelo menos 10 vértices)
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
No file, test, or entry point is named. Start by reading the repository to find the existing graph representation and traversal examples, then define a group-approved example with at least 10 vertices; done means a working depth-first-search application for that example.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- data
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Quiet
- Clarity
- Needs clarification
- Newbie friendliness
- 35/100