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