You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+1-1Lines changed: 1 addition & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -13,7 +13,7 @@ We give a deterministic O(mlog2/3n)-time algorithm for single-source shortest pa
13
13
14
14
## Development Details
15
15
16
-
This project is mainly focused in implementations in C++ (std=c++20) and Javascript (in order to be published to npmjs.com via github Actions). It would be interesting to do the same to publish via pypi.org or crates.io.
16
+
This project is mainly focused in Javascript (in order to be published to npmjs.com via github Actions).
A compilation of implementations of the Single Source Shortest Path (SSSP) algorithm, inspired by Tsinghua University's research.
72
+
Implementations of the Single Source Shortest Path (SSSP) algorithm - Bounded Multiple Source Shortest Paths (BMSSP), originally published by Tsinghua University's research.
0 commit comments