AoC2021 VS advent-of-code

Disclaimer: I am learning Elixir this year trough AoC so code quality is in a shape that could find a place on r/programinghorror I would like to ask with help optimising algorithm I made for solving today's (day 15, 2021) Advent of Code problem. I implemented Dijkstra's (I think) and first part already need 35+ seconds to get the resautls. This is the code I made but I don't know how to optimize it (Maps probably aren't the most efficient thing to use in code that goes that far into recursion), to reach some more normal execution times. I would like to not use 3rd party/external libraries if possible, but any help is appriciated.

Elixir Quite a fun little exercise today. Code is still ugly as death, but I finally feal like I can enjoy the language freely. On other note, how could I solve the problem with me having to push char at the amstart of array without overloading process_line/2 ? (Line 5)

elixir Probably not very efficient and quite ugly. But it works... If anyone has any sugestions how to make it better (how to become better @elixir) i would greatly appriciate it

My solution in elixir (github link) It's not the cleanest fastest solution probably but does the job well enough. Still fighting with language a bit and forgeting some things in it sometimes (first time using it)