Skip to content
DigitalCurrensyPublic

About

For a traverse planner. Finds the lowest-dose walk on an eight-neighbor grid of costs you supply. A missing or negative edge is not a step. Over the dose cap, or out of time, the answer is stay. Not a radiation model.

Topics

Resources

Code of conduct

Contributing

Security policy

Stars

2 stars

Watchers

0 watching

Forks

DOSEPATH

check

For a traverse planner who already has a grid of dose costs.

The command finds the lowest-dose eight-neighbor walk. A missing, negative, or non-finite edge is not a step. Over the dose cap, or out of time, the answer is stay.

This is not a radiation model. You bring the costs.

Install

pip install -e .
PYTHONPATH=src python -m unittest tests.test_kernel

First command

PYTHONPATH=src python -m dosepath examples/edges.csv --start 0,0 --goal 1,0 --t0 0 --tmax 5 --dose-cap 10

The rest of this file is the formula that command prints.

Record

--json prints one object. The process exit code is that object's exit. 0 is a pass word (ok, pass, scored, path). 1 is a refusal. 2 means the file could not be read. keep is false. absent is what this output does not contain: a stamp, measured basin months, and the points inside a .laz file.

This object is not WaterML and it is not a USGS response.

{
  "absent": [
    "stamp",
    "measured_months",
    "laz_points"
  ],
  "desk": "dosepath",
  "exit": 0,
  "formula": "Occupancy is cost. Over the cap, or out of time, is stay.",
  "keep": false,
  "rows": [
    {
      "line": "dose=1 edges=1 0,0 1,0",
      "word": "path"
    }
  ],
  "word": "path"
}

For a crew planner who needs a walk across a grid, or a stay.

Owner: Digital Currensy Inc. Copyright: 2026 Digital Currensy Inc. License: Apache-2.0. The file named LICENSE is the standard license and is not edited. The copyright notice is in NOTICE and at the top of each source file.

What it decides

A path, or a stay. No path is a result. If the cheapest walk exceeds the dose cap, that is a stay too.

The rule

This is a grid search in eight directions. Orthogonal and diagonal steps each take one tick. The dose is the sum of the costs in the caller's table. The line prints that sum, the number of edges that were added, then the nodes. Costs are not negative, so the first time the goal leaves the heap is the minimum sum. stay means no walk was accepted, so there is no dose. A missing edge is not a step. A negative cost is not a step. A non-finite cost is not a step. A non-finite dose cap is a stay, not an open cap. The route is the cheapest walk that finishes inside the time. If every walk breaks the clock, or the cheapest walk breaks the dose cap, the desk says stay.

Standing on the start cell is a path of one node when the clock still has time and the dose cap allows a cost of zero. It is not a free wait while the field changes.

Worked rows

examples/edges.csv is a small grid that has a path. It is not a crew timeline a customer sent.

What it will not do

  • Invent a path after the clock runs out.
  • Accept a walk whose cost exceeds the dose cap.
  • Sign a flight rule.

Run

git clone <this repo>
cd dosepath
PYTHONPATH=src python -m unittest tests.test_kernel
PYTHONPATH=src python -m dosepath examples/edges.csv --start 0,0 --goal 1,0 --t0 0 --tmax 5 --dose-cap 10

Python 3.11 or newer. No third-party packages. A path and a stay both exit 0.

About

For a traverse planner. Finds the lowest-dose walk on an eight-neighbor grid of costs you supply. A missing or negative edge is not a step. Over the dose cap, or out of time, the answer is stay. Not a radiation model.

Topics

Resources

Code of conduct

Contributing

Security policy

Stars

2 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages