Homepage

a-star-search vulnerabilities

A special case of best-first graph search that uses heuristics to improve speed. Define your 2D grid then add any blocked coordinates to the environment that must be avoided when generating the shortest path. Written in CoffeeScript.

< Back for full overview of a-star-search vulnerabilities

Package versions

12 VERSIONS IN TOTAL
versionpublisheddirect vulnerabilities
0.1.1322 Sep, 2017
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
0.1.1211 Jan, 2015
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
0.1.1126 May, 2014
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
0.1.1026 May, 2014
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
0.1.924 May, 2014
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
0.1.824 May, 2014
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
0.1.624 May, 2014
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
0.1.424 May, 2014
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
0.1.324 May, 2014
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
0.1.224 May, 2014
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
0.1.124 May, 2014
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
0.1.024 May, 2014
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L

Automatically find and fix vulnerabilities affecting your projects. Snyk scans for vulnerabilities and provides fixes for free.

Get started free