sander/pathfinder
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

comments

Browse source
This commit is contained in:
Shautvast 2024-11-12 12:33:21 +01:00
parent af2a2fc8fc
commit 226dee33cc
1 changed files with 4 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
solution2/src/algorithm.rs
View file

@ -81,12 +81,14 @@ pub fn find_optimal_path(
let mut current_path; let mut current_path;
while running && !paths_to_consider.is_empty() { while running && !paths_to_consider.is_empty() {
paths_to_consider.sort(); // would have liked a list like datastructure that is guaranteed to be sorted
// BTreeSet would be nice, but equals/hash/cmp calls would be unneeded overhead
paths_to_consider.sort(); // but this is also overhead compared to BTreeSet
current_path = paths_to_consider.last().unwrap().clone(); // assert = Some current_path = paths_to_consider.last().unwrap().clone(); // assert = Some
// evict paths that are of max len // evict paths that are of max len
while current_path.length() >= t { while current_path.length() >= t {
_ = paths_to_consider.pop(); _ = paths_to_consider.pop(); // discards element that = current_path
if current_path.value() > max.value() { if current_path.value() > max.value() {
max = current_path.clone(); // sorry max = current_path.clone(); // sorry
} }