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

Can isolated subgraphs appear and with what probability?

Open
#2 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
20/100
Issue type
Documentation
Clarity
Needs clarification
Activity status
Stale
Tech stack
go
Domain
search

Research direction

Start by reading the algorithms for adding and deleting nodes, then trace how the multi-layered architecture is intended to preserve connectivity. The issue asks for an intuitive explanation of that guarantee and for the probability of isolated subgraphs, including how increasing M affects it. Done means providing a clear, supported answer to both questions.

Written by the indexing model from the issue text.

Description

question

This a question of graph theory that is beyond my reach. I don't understand, intuitively, why the algorithms to add and delete nodes strongly guarantee a connected graph. I understand how it is unlikely due to the multi-layered architecture and I understand how we can decrease the probability of isolation by increasing M.

Dominant language
Go
Stars
241
Forks
35
PR merge metrics
No merged PRs in 30d

Getting set up

This project ships no dev container, Dockerfile or contributing guide, so setting up is up to you: start from its README, and see our first-contribution guide for the general steps.

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 coder/hnsw

All issues in coder/hnsw

Similar issues

More Go issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.