"The nodes are related to segments with extra information about travel direction. Edges are related to segment connections (transitions)" I see. So, if I understand correctly, most of these cases arise from fact that train can be "in the middle" of some edge of graph on which pa...

I am wondering why your implementation of Dijkstra algorithm has so many corner cases. I don't know how trains work in Factorio because I didn't make so far in this game yet, but if you can model your problem as searching for shortest path in graph with non-negative weights on edges, implementation...

I am wondering why your implementation of Dijkstra algorithm has so many corner cases. I don't know how trains work in Factorio because I didn't make so far in this game yet, but if you can model your problem as searching for shortest path in graph with non-negative weights on edges, implementation ...

I very much enjoyed the pathfinding discussion and I made sure I understood every issue and solution before moving on. From a FIT (or CTU in English) uni, where we discussed Dijkstra, binary heap, Linked lists and all that stuff, it is always nice to see them used and inspires you to learn them. An...