daniel/advent-of-code-2021
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

indentation

Browse Source
This commit is contained in:
Daniel Borges
2021-12-12 20:37:37 +01:00
parent 6a0df03604
commit ea9e5b7167
1 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
12-passage-pathing/code.scm
View File

@@ -63,10 +63,10 @@
(lambda (child) (lambda (child)
(let [(is-big (is-big? child))] (let [(is-big (is-big? child))]
(when (and (not (string=? child "start")) (when (and (not (string=? child "start"))
(or is-big (or is-big
(< (count-members child path) max-small))) (< (count-members child path) max-small)))
(visit child (cons node path) (visit child (cons node path)
(if (and (not is-big) (member child path)) 1 max-small))))) (if (and (not is-big) (member child path)) 1 max-small)))))
(hashtable-ref graph node '()))))) (hashtable-ref graph node '())))))
; computes how many possible paths there are in graph ; computes how many possible paths there are in graph
@@ -103,6 +103,6 @@
(lambda (file) (lambda (file)
(let [(graph (make-graph file))] (let [(graph (make-graph file))]
(printf "part 1:~% ~a paths with at most 1 visit to small caves.~%" (printf "part 1:~% ~a paths with at most 1 visit to small caves.~%"
(count-paths graph 1)) (count-paths graph 1))
(printf "part 2:~% ~a paths with at most 2 visits to small caves.~%" (printf "part 2:~% ~a paths with at most 2 visits to small caves.~%"
(count-paths graph 2))))) (count-paths graph 2)))))