ok so i finally get Dijkstra's and it's because i drew the priority queue
spent weeks thinking i understood it. did not. every explanation shows you the final shortest-path tree and skips the part where the queue is actively repricing edges mid-run, which is kind of the whole algorithm??