aoc22 VS advents-of-code

Here's just the interesting bit, full solution here. ``` fn dijkstra(unvisited: &mut Unvisited, start: Pos, end: Pos) -> Option { fn update_neighbor(unvisited: &mut Unvisited, cur: &Node, pos: Pos) { if let Some(neigh) = unvisited.get_mut(&(pos)) { // Steepness check. if neigh.val <= cur.val + 1 { neigh.dist = neigh.dist.min(cur.dist + 1.); } } }

Tiny little thing you could do to make this even more succinct: Use `abs()` on `dx` and `dy`, that's what I did!

HashMap for parsing stacks and Vec> for operations. Full code here.