Garmelon/advent-of-code
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

[rs] Add comment on simpler approach

Browse source
This commit is contained in:
Joscha 2022-12-14 21:24:53 +01:00
parent 93529c4173
commit b9fad24df2
1 changed files with 4 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

4
rs/src/y2022/d12.rs
View file

@ -1,5 +1,9 @@
use std::collections::BinaryHeap; use std::collections::BinaryHeap;
// This could've been implemented a lot simpler by
// 1. Using a HashMap<(i32, i32), usize> as a grid
// 2. Using a simple (round-based?) BFS instead of a Dijkstra
#[derive(Debug)] #[derive(Debug)]
struct Grid<T> { struct Grid<T> {
width: usize, width: usize,