A parallelized brute-force program for finding and plotting all shortest paths that touch every square in an n by n grid

Python implementation of the backtracking approach to find a Hamiltonian path in a given graph.

cool Fortran implementation of linked lists for traversing through nodes and finding the hamiltonian path (dynamically)

Implement a Hamiltonian path algorithm, and Design a tour for visiting all cities of a country. (PHP)

DSA Graph Analysis Project

Generates Hamiltonian Paths/Cycles to Beat the Snake Game

Complex algorithms in Python

This project aims to implement an algorithm to find a Hamiltonian Path in a graph (directed or undirected). A Hamiltonian Path is a path that visits each vertex exactly once.