Hacktoberfest 2026: the issues maintainers tagged for October, open and beginner-friendly. Browse Hacktoberfest issues

B18 (Opcional)

Open
#32 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
5/5
Estimated time
Over a week
Newbie friendliness
25/100
Issue type
Feature
Clarity
Needs clarification
Activity status
Quiet
Tech stack
cpp
Domain
data

Research direction

No file, test, or entry point is named in the issue. Start by reading the repository structure and any project instructions to find where graph operations are implemented; before coding, clarify the expected input, output, and meaning of “grafo subjacente.” Done requires an agreed specification and a verifiable implementation.

Written by the indexing model from the issue text.

Description

trabalho1

Determinação de Grafo subjacente (Opcional = 0.5 ponto) (DIGRAFO1)

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

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from lambda-loop/graphs

All issues in lambda-loop/graphs

Similar issues

More C++ issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.