Skip to content

Add a simpler solution #46

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
votroto merged 1 commit into from
Mar 20, 2025
Merged

Add a simpler solution #46

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 8 additions & 1 deletion labs/lab05.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -127,14 +127,21 @@ Now we can apply the above function to all permutations. The function `(check-pa
permutations of nodes and filter those which form a path. If there is a permutation being a path
simultaneously, we have a Hamiltonian path. Otherwise, we return `#f`.
::: details Solution: `find-hamiltonian-path`
```racket
::: code-group
```racket [filter]
(define (find-hamiltonian-path g)
(define perms (permutations (graph-nodes g)))
(let ([paths (filter identity (map (check-path g) perms))])
(if (null? paths)
#f
(car paths))))
```
```racket [ormap]
(define (find-hamiltonian-path g)
(define perms (permutations (graph-nodes g)))
(ormap (check-path g) perms))
```
:::

If you are curious, try to use the function `in-permutations` to compute the `perms` lazily and
compare the perfromance of the two implementations on a larger graph.
Expand Down