BFS example works perfectly. But I am not developing an FPs. I am developing a single player game. I have many paths for different situations. Your BFS example stores nodes into arrays and the calculates the required solutions on those array's at run time. It wont be good/possible to apply this solution for very many paths.
I will study BFS and see if it can be of any help. But from the 15 years experience of working with every major programming language, I know that it would be very simple to implement the solution that I have already suggested. But I dont know how conitec is storing edge data for every node, else I would have helped them to find the perfect solution.