BFS based path planning algorithms (UCS Astar) generates paths that overcount the amount of lines actually required to achieve the path. Currently, a temporary findLines() function updates the line transfer design required to achieve a path generated by the algorithm. This is pretty janky.
Make a better findLines() function that does not hop between paths
Somehow incorporate line information into the add station function such that line information is accounted for during path construction.
BFS based path planning algorithms (UCS Astar) generates paths that overcount the amount of lines actually required to achieve the path. Currently, a temporary findLines() function updates the line transfer design required to achieve a path generated by the algorithm. This is pretty janky.
Make a better findLines() function that does not hop between paths
Somehow incorporate line information into the add station function such that line information is accounted for during path construction.