Repository navigation
Explore
This option finds a minimum cost path from a source node to a destination through costed links in a square 2D grid, when the link cost is only discovered when the link is reached
The first line specifies the calculation required. It must contain
format explore
| Column | Description |
|---|---|
| 1 | d |
| 2 | size of square 2D grid to construct |
| Column | Description |
|---|---|
| 1 | b |
| 2 | blocked cell column |
| 3 | blocked cell row |
| Column | Description |
|---|---|
| 1 | s |
| 2 | start cell column |
| 3 | start cell row |
| Column | Description |
|---|---|
| 1 | e |
| 2 | end cell column |
| 3 | end cell row |
format explore
d 5
b 2 1
b 2 2
b 2 3
s 0 4
e 4 0
Finds path using the A* algorithm.
