Implementing the sssp algorithm presented by Duan Ran et.al. from Tsinghua University (BMSSP).

2 stars 0 forks 2 watchers JavaScript Mozilla Public License 2.0
bmssp hacktoberfest shortest-paths-algorithm
10 Open Issues Need Help Last updated: Sep 13, 2025

Open Issues Need Help

View All on GitHub
help wanted

Implementing the sssp algorithm presented by Duan Ran et.al. from Tsinghua University (BMSSP).

JavaScript
#bmssp#hacktoberfest#shortest-paths-algorithm
help wanted good first issue

Implementing the sssp algorithm presented by Duan Ran et.al. from Tsinghua University (BMSSP).

JavaScript
#bmssp#hacktoberfest#shortest-paths-algorithm

Implementing the sssp algorithm presented by Duan Ran et.al. from Tsinghua University (BMSSP).

JavaScript
#bmssp#hacktoberfest#shortest-paths-algorithm

Implementing the sssp algorithm presented by Duan Ran et.al. from Tsinghua University (BMSSP).

JavaScript
#bmssp#hacktoberfest#shortest-paths-algorithm
help wanted

Implementing the sssp algorithm presented by Duan Ran et.al. from Tsinghua University (BMSSP).

JavaScript
#bmssp#hacktoberfest#shortest-paths-algorithm
help wanted good first issue

Implementing the sssp algorithm presented by Duan Ran et.al. from Tsinghua University (BMSSP).

JavaScript
#bmssp#hacktoberfest#shortest-paths-algorithm
help wanted good first issue

Implementing the sssp algorithm presented by Duan Ran et.al. from Tsinghua University (BMSSP).

JavaScript
#bmssp#hacktoberfest#shortest-paths-algorithm

AI Summary: This issue requests the creation of a `singleSourceShortestPaths` function. Its initial implementation should be limited to setting the source node's distance to zero and all other nodes' distances to an infinite value.

Complexity: 1/5
help wanted good first issue

Implementing the sssp algorithm presented by Duan Ran et.al. from Tsinghua University (BMSSP).

JavaScript
#bmssp#hacktoberfest#shortest-paths-algorithm

AI Summary: This task involves adding a new property called `vertex_index` to the `BMSSP` class constructor. This property should be a list of all unique node IDs, derived by traversing the existing edge list and collecting the 'from' and 'to' values from each edge. A corresponding test case needs to be added.

Complexity: 2/5
help wanted good first issue

Implementing the sssp algorithm presented by Duan Ran et.al. from Tsinghua University (BMSSP).

JavaScript
#bmssp#hacktoberfest#shortest-paths-algorithm
help wanted good first issue

Implementing the sssp algorithm presented by Duan Ran et.al. from Tsinghua University (BMSSP).

JavaScript
#bmssp#hacktoberfest#shortest-paths-algorithm