Haha hey, Monokkel! Yeah it’s not the first time I see you reply in my threads, so thanks for reading! 
I based my pathfinding on A*, but it’s not exactly the same I think so probably more like Dijkstra’s. I have not yet fully implemented the ability to take tile cost in to account I think, but the tiles do have the variable. I’ve read a bit of Amit’s website back when I started with this. Might have to reread some stuff, thanks 
Yeah that is what I do, each tile has a parent tile var. I do everything in one function. So it does the pathfinding and then it creates an arrat with the shortest path, with the parent tile variable thing. And then I return the array.
If I have time tonight I’ll fire up my project and see if I can give you more exact times of the functions
Thanks for replying!