manrajgrover / manrajgrover/algorithms-js

Implement Graph Algorithms

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

Nobody has claimed this yet.

algorithms dependency good first issue hacktoberfest
Dominant language
JavaScript
Stars
200
Forks
136
No merged PRs in 30d

Description

Graph Algorithms to be implemented are:
Shortest Distance
  • Bellman Ford
  • Floyd Warshall
  • Dijkstra
  • Johnson
Search
  • BFS
  • DFS

Contributor guide

Open the contributing guide

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

Start by inspecting the repository structure and the existing BFS and DFS implementations to understand the library's algorithm conventions. Implement Bellman-Ford, Floyd-Warshall, Dijkstra, and Johnson for shortest-distance support; done means all four unchecked items are completed and covered by the project's existing validation approach.

Written by the indexing model from the issue text.

Assessment

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

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.