I was working on some Leetcode questions for Dijkstra’s algorithm and I do not quite understand the space complexity of it. I looked online but I found various answers and some were rather complicated so I wanted to know if I understood it correctly.