HowProgrammingWorks / HowProgrammingWorks/Graph

Задачки в лекции

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

Nobody has claimed this yet.

Dominant language
JavaScript
Stars
13
Forks
15
PR merge metrics
No merged PRs in 30d

Description

  • переписать метод .insert так, чтобы он возвращал вставленные вершины, изменить контракт .link, .to, чтобы они принимали ссылки на вершины, а не ключи.

  • переписать метод .select, чтобы в query не было обязательным наличия индекса по первому полю

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.

Research direction

Locate the .insert, .link, .to, and .select methods in the graph implementation and read their current contracts. Update the behavior so .insert returns inserted vertices, .link and .to accept vertex references, and .select does not require an index on the first query field. Confirm each requested contract change against the existing implementation.

Written by the indexing model from the issue text.

Assessment

Tech stack
javascript
Domain
data
Issue type
Refactor
Difficulty
4/5
Estimated time
3-5 days
Activity status
Stale
Clarity
Mostly clear
Newbie friendliness
35/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.