lambda-loop / lambda-loop/graphs
A11
Open
Nobody has claimed this yet.
trabalho1
- Dominant language
- C++
- Stars
- 3
- Forks
- 0
- PR merge metrics
- No merged PRs in 30d
Description
Função que determina se um grafo é conexo ou não (GRAFO1, GRAFO2)
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 searching the repository for GRAFO1 and GRAFO2 to find the relevant graph representation and entry point. Read the surrounding implementation and determine how connected and disconnected graphs are represented. Done means a function is available for both graph cases and its behavior can be verified with representative inputs.
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
- Needs clarification
- Newbie friendliness
- 48/100