You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
at the very first: thanks for this awesome repository! 🙏
It helps so much to create tools around GTA/FiveM/...
If I draw all the connected nodes from nodes.json on a map there are a ton of gaps - which makes real navigation impossible as nearly all roads have a gap somewhere in the middle.
Is there any reason behind it? Or does GTA solve that on runtime by finding the closest node if it reaches one of these dead ends and "jumps" to this one? 🤔
So for sure I can go through the nodes and add all the missing pieces or find an algorithm to add connections between these dead-ends. Just wanted to check if there's an "official" way or if the dump misses some connections between single nodes.
The text was updated successfully, but these errors were encountered:
I guess this all makes somehow sense for their path finding algorythm - could also be related to various flags that were unknown when I first time looked into this. Some flags indicate for example whether a node is only valid for special cases, or for lane switching, turning or whatever. Could all be related to this
Yeah, the flags make sense - as it's nearly always related to larger junctions, multi-lane streets and driveways.
I'm nearly done connecting all of them, luckily I just need undirected connections.
As I'm pretty sure that directed connections would be even more missing. It was ~4000 deadends (nodes with just one connection) and also a lot of just missing connections.
Hey,
at the very first: thanks for this awesome repository! 🙏
It helps so much to create tools around GTA/FiveM/...
If I draw all the connected nodes from nodes.json on a map there are a ton of gaps - which makes real navigation impossible as nearly all roads have a gap somewhere in the middle.
Is there any reason behind it? Or does GTA solve that on runtime by finding the closest node if it reaches one of these dead ends and "jumps" to this one? 🤔
So for sure I can go through the nodes and add all the missing pieces or find an algorithm to add connections between these dead-ends. Just wanted to check if there's an "official" way or if the dump misses some connections between single nodes.
The text was updated successfully, but these errors were encountered: