---
title: "Discussion on \"Hamiltonian Walks using Bitmask DP\" | Hashnode"
description: "Discussion on \"Hamiltonian Walks using Bitmask DP\". Hamiltonian Walk is a common application of Bitmask DP.\nThe problem is simple:\n\nGiven a graph, find the shortest path that visits every vertex exactly once.\n\nWe can solve this using:\n\nBitmasking to st"
url: "https://hashnode.com/posts/hamiltonian-walks-using-bitmask-dp/6aaccb6fc72fa9a8dcee3de2"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Hamiltonian Walks using Bitmask DP](https://tarshawkman.hashnode.dev/hamiltonian-walks-using-bitmask-dp?utm_source=hashnode&utm_medium=feed)

Hamiltonian Walk is a common application of Bitmask DP. The problem is simple: Given a graph, find the shortest path that visits every vertex exactly once. We can solve this using: Bitmasking to st

Sep 18 · 9 min read · tarshawkman.hashnode.dev  
Read the article

## Written by

[Aaditya Saraf](https://hashnode.com/@aadityasaraf)

@aadityasaraf · nanya

  
[View profile](https://hashnode.com/@aadityasaraf)

huehuehue

lolz, jus' chill

## Responses

Markdown supported · ⌘↵ to post

No responses yet.