Python package wrapping scipy's dijkstra with a grid-based interface
Project description
# gridijkstra Python package wrapping scipy’s dijkstra with a grid-based interface
`python >>> import gridijkstra >>> import numpy as np >>> costs = np.ones((50, 60)) >>> costs[10:15, :20] = 1e30 # np.inf also works, but is less convenient for plotting >>> costs[20:25, 25:55] = 1e30 >>> costs[30:40, 30:40] = 1e30 >>> start = (2, 2) >>> target = (48, 58) >>> total_cost, path = gridijkstra.plan(costs, start, target, return_path=True) >>> print(f'Full path length: {total_cost}') 'Full path length: 102.0' `
Three use cases are shown below. See scripts/examples.ipynb for a notebook with examples
![](scripts/example1.svg)
![](scripts/example2.svg)
![](scripts/example3.svg)
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for gridikjstra-0.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 0f635db0bb66319cb00522e86673f5144bc3d569e0dc62f12c9a18d0b38dc32a |
|
MD5 | 520a921f852bbf32d3dc7c502be6a661 |
|
BLAKE2b-256 | a74d40ec3c2dc708fe8b13c1fa4a1ba1522bd8d7a1ee1a914b6935ba69fb690e |