typescript-algorithms
typescript-algorithms copied to clipboard
FSou1
🔖 Algorithms and data structures implemented in TypeScript
Bumps [ajv](https://github.com/ajv-validator/ajv) from 6.12.0 to 6.12.6. Release notes Sourced from ajv's releases. v6.12.6 Fix performance issue of "url" format. v6.12.5 Fix uri scheme validation (@ChALkeR). Fix boolean schemas with strictKeywords...
![dependabot[bot] avatar](https://avatars.githubusercontent.com/in/29110?v=4 "dependabot[bot] avatar"){kind=avatar}
Bumps [ws](https://github.com/websockets/ws) from 7.2.3 to 7.5.9. Release notes Sourced from ws's releases. 7.5.9 Bug fixes Backported bc8bd34e to the 7.x release line (0435e6e1). 7.5.8 Bug fixes Backported 0fdcc0af to the...
Bumps [tmpl](https://github.com/daaku/nodejs-tmpl) from 1.0.4 to 1.0.5. Commits See full diff in compare view [](https://docs.github.com/en/github/managing-security-vulnerabilities/about-dependabot-security-updates#about-compatibility-scores) Dependabot will resolve any conflicts with this PR as long as you don't alter...
Bumps [path-parse](https://github.com/jbgutierrez/path-parse) from 1.0.6 to 1.0.7. Commits See full diff in compare view [](https://docs.github.com/en/github/managing-security-vulnerabilities/about-dependabot-security-updates#about-compatibility-scores) Dependabot will resolve any conflicts with this PR as long as you don't alter...
Once the priority queue is added, it's worth polishing the implementation of the Dijkstra to improve the running time
A priority queue data structure should be added to adjust the current implementation of the Dijkstra's algorithm (it's actual running time complexity is inexcusable)
It does make sense to add a max heap implementation since we are going to add a min heap one