{
  "name": "AStarSearch",
  "version": "0.1.0",
  "summary": "A* search algorithm",
  "description": "A simple algorithm to search for the optimal path between start and end point in the matrix",
  "homepage": "https://github.com/kamsebgoralski/AStarSearch",
  "license": {
    "type": "MIT",
    "file": "LICENSE"
  },
  "authors": {
    "Kamil Góralski": "kamsebgoralski@gmail.com"
  },
  "platforms": {
    "ios": "8.0",
    "osx": "10.9"
  },
  "swift_versions": "5.0",
  "source": {
    "git": "https://github.com/kamsebgoralski/AStarSearch.git",
    "tag": "0.1.0"
  },
  "source_files": "Sources/AStarSearch/*.swift",
  "requires_arc": true,
  "frameworks": "Foundation",
  "testspecs": [
    {
      "name": "Tests",
      "test_type": "unit",
      "source_files": "Tests/AStarSearchTests/*.swift"
    }
  ],
  "swift_version": "5.0"
}