B20

Open
#34 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
55/100
Issue type
Feature
Clarity
Mostly clear
Activity status
Quiet
Tech stack
cpp
Domain
data

Research direction

Locate DIGRAFO2 and DIGRAFO3 in the repository and inspect the existing depth-first search implementation. Trace how vertices and edges are represented, then implement the requested entry and exit depths and edge classifications; done means the two named graph components expose the requested results and their existing checks pass.

Written by the indexing model from the issue text.

Description

trabalho1

Busca em profundidade, com determinação de profundidade de entrada e de saída de cada vértice e definiçã de arestas de arbore, retorno, avanço ou cruzamento (DIGRAFO2, DIGRAFO3)

Dominant language
C++
Stars
3
Forks
0
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.