-
Hey man, while using your fantastic rep I encountered a bug in the astar header, in particular the indexing of the grid in the neighbor search when using nx,ny and cx,cy where swapped. That was causin…
-
Hello,
I have a world which is based on a grid, but the characters roam freely in it. As such, I'd like to allow diagonal movement for the path finding, but not when it would cut over a corner. Below …
tapio updated
10 years ago
-
-
``` python
>>> import networkx as nx
>>> G = nx.DiGraph()
>>> G.add_edge(0, 1, weight=1)
>>> G.add_edge(0, '1', weight=1)
>>> nx.single_source_dijkstra(G, 0)
Traceback (most recent call last):
File …
ysitu updated
10 years ago
-
Any interest in this feature? Basically, you can have a graph with different weights on locations. This would factor into the distance cost of a particular path and change the recommended path.
How…
-
Old Greywater Alpha Pathfinding is quite expensive. Though the framework doesn't yet support moving/pathfinding, begin looking at making pathfinding more efficient
-
I made my own version of the node class and it wouldn't compile, so I tried to compile both example files and both give me this error:
h:\programming\c++\astar-algorithm-cpp-master\stlastar.h(60): err…
-
repro:
1. try out web version with graphhopper.sh
```
./graphhopper.sh web europe_germany_berlin.osm
```
_europe_germany_berlin-gh_ folder is created
1. try to use generated *-gh folder from your o…
-
Any clues on how you could get this to work in a 3d environment, such as voxeljs?
initially thought it could work if I simply scored each possible voxel around the pathfinder, but not sure how I'd fe…
-
The result returned by astar is not optimal for fastest calc problems ...
GraphStorage graph = new GraphBuilder().create();
final VehicleEncoder enc = AcceptWay.parse("CAR").firstEncoder();
graph.set…