manrajgrover/algorithms-js

Implement Graph Algorithms

Open

#9 opened on May 23, 2017

View on GitHubContributor guide
 (9 comments) (0 reactions) (0 assignees)JavaScript (133 forks)github user discovery
algorithmsdependencygood first issuehacktoberfest

Repository metrics

Stars
 (200 stars)
PR merge metrics
 (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

Research direction
Study the existing BFS and DFS implementations in the repository to understand the coding style and structure, then implement the shortest distance algorithms following the same pattern.
Tech stack
javascript
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
3-5 days
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
JavaScriptGraph Algorithms
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
65