package.json

{
  "name": "dijkstras",
  "version": "0.0.3",
  "description": "Efficient implementation of Dijkstra's algorithm, with TypeScript support. This package is designed to be usable in both Node.js and browsers.",
  "main": "./dist/index.js",
  "module": "./dist/index.mjs",
  "types": "./dist/index.d.ts",
  "scripts": {
    "test": "jest",
    "test:watch": "jest --watchAll ",
    "build": "tsup src/index.ts --format cjs,esm --dts-resolve --minify --clean --sourcemap --dts"
  },
  "repository": {
    "type": "git",
    "url": "https://github.com/useCallback/dijkstras.git"
  },
  "author": {
    "name": "Khalfoun Mohamed El Mehdi",
    "url": "https://github.com/useCallback",
    "email": "contact.khalfoun@gmail.com"
  },
  "keywords": [
    "dijkstra",
    "dijkstras",
    "dijkstra algorithm",
    "pathfinding",
    "shortest path",
    "route finding"
  ],
  "license": "MIT",
  "bugs": {
    "url": "https://github.com/useCallback/dijkstras/issues"
  },
  "homepage": "https://github.com/useCallback/dijkstras",
  "devDependencies": {
    "@types/deep-equal": "^1.0.1",
    "@types/jest": "^29.5.3",
    "expect.js": "^0.3.1",
    "jest": "^29.6.2",
    "ts-jest": "^29.1.1",
    "tsup": "^7.2.0"
  },
  "jest": {
    "moduleFileExtensions": [
      "js",
      "json",
      "ts"
    ],
    "rootDir": "src",
    "testRegex": ".*\\.test\\.ts$",
    "transform": {
      "^.+\\.(t|j)s$": "ts-jest"
    },
    "collectCoverageFrom": [
      "**/*.(t|j)s"
    ],
    "coverageDirectory": "../coverage",
    "testEnvironment": "node"
  },
  "dependencies": {
    "deep-equal": "^2.2.2"
  }
}