Need help with code efficiency (day 15 AoC, part 1 and 2)

• AoC2021

  4 0 0.0 Elixir

  Advent of Code 2021 (by EragonpeerGynt)

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.

• libgraph

  2 502 3.4 Elixir

  A graph data structure library for Elixir projects

I was too lazy to implement Dijkstra's algorithm myself, so I used libgraph.

• InfluxDB

  www.influxdata.com featured

  Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

  

• AdventOfCode2021

  2 1 0.0 Elixir

I'm also doing this year's AoC in Elixir as a learning exercise, and I implemented a crude priority queue for today's task. Here's the code to give you an idea of how to implement it yourself: https://github.com/CallumHutchison/AdventOfCode2021/blob/master/lib/day15/PriorityQueue.ex

Suggest a related project