Homepage

ml-floyd-warshall vulnerabilities

Algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles)

  • latest version

    3.0.1

  • latest non vulnerable version

    3.0.1

  • first published

    8 years ago

  • latest version published

    1 years ago

  • licenses detected

  • View ml-floyd-warshall package health on Snyk Advisor  (opens in a new tab)
    • Report a new vulnerability Found a mistake?

    Direct Vulnerabilities

    No direct vulnerabilities have been found for this package in Snyk’s vulnerability database. This does not include vulnerabilities belonging to this package’s dependencies.

    Does your project rely on vulnerable package dependencies?

    Automatically find and fix vulnerabilities affecting your projects. Snyk scans for vulnerabilities (in both your packages & their dependencies) and provides automated fixes for free.

    Scan for indirect vulnerabilities

    Package versions

    1 - 7 of 7 Results
    versionpublisheddirect vulnerabilities
    3.0.127 Feb, 2023
    • 0
      C
    • 0
      H
    • 0
      M
    • 0
      L
    2.0.122 Nov, 2022
    • 0
      C
    • 0
      H
    • 0
      M
    • 0
      L
    1.0.428 Feb, 2022
    • 0
      C
    • 0
      H
    • 0
      M
    • 0
      L
    1.0.323 Jan, 2020
    • 0
      C
    • 0
      H
    • 0
      M
    • 0
      L
    1.0.223 Jan, 2020
    • 0
      C
    • 0
      H
    • 0
      M
    • 0
      L
    1.0.121 Jan, 2020
    • 0
      C
    • 0
      H
    • 0
      M
    • 0
      L
    1.0.030 Aug, 2016
    • 0
      C
    • 0
      H
    • 0
      M
    • 0
      L