-
**What Course are you in**
https://runestone.academy/runestone/books/published/pythonds/Graphs/DiscussionQuestions.html
**Describe the bug**
The numbering of the questions is wrong (there are 2 n…
-
When creating multiple worlds sequentially, the preview doesn't draw quite right. It looks like any tile in the map that is identical to the previous world remains black, which I'm going to guess is …
-
Let's move the discussion here.
As far as I can see, the current possibilities are
- Irmin (a bit overkill, but would allows fancy history thingy. May be the shortest path to completion)
- https://gi…
-
If the task "unloading of the combine" and A.D. starts not within the borders of the field, then the setting "Restrict pathfinder to field" is ignored. As a result, in the fields of complex shape, A.D…
-
```
What steps will reproduce the problem?
1. Create a new AreaMap with x=30, y=30
2. Create obstacles[][] array with the same dimensions
3. look for shortest path between 0,1 and 29,29
What is the e…
-
```
What steps will reproduce the problem?
1. Create a new AreaMap with x=30, y=30
2. Create obstacles[][] array with the same dimensions
3. look for shortest path between 0,1 and 29,29
What is the e…
-
edit story 3
-
## 🚀 Feature
An algorithm to find the shortest path from a vertex to all other vertices of a weighted graph.
### Have you read the Contribution Guidelines?
Yes
## Pitch
It is similar to…
-
Currently don't account for land in the patch of travel distance, but we should account for this and calculate distance when circumventing land in distance.
-
With great interest I read the following blog post:
https://lpython.org/blog/2023/07/lpython-novel-fast-retargetable-python-compiler/
But to my surprise I discovered the C++ code in the benchmar…