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

Q3 - Aula 4

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

Nobody has claimed this yet.

Assessment

Difficulty
3/5
Estimated time
1-2 days
Newbie friendliness
35/100
Issue type
Feature
Clarity
Mostly clear
Activity status
Stale
Tech stack
cpp
Domain
data

Research direction

Start by reading the issue's referenced slide, Grafos_U01_A04_Estruturas_Dados_Grafos.pdf, and locate the repository's existing graph representation or executable entry point. Implement the conversion from a directed adjacency matrix to an incidence matrix, then verify that each directed edge is represented correctly in the resulting matrix.

Written by the indexing model from the issue text.

Description

Dada uma representação de um grafo direcionado
por matriz de adjacência, faça um algoritmo que
represente o grafo em matriz de incidência.

slide: Grafos_U01_A04_Estruturas_Dados_Grafos.pdf

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.