Skip to main content

Indie game storeFree gamesFun gamesHorror games
Game developmentAssetsComics
SalesBundles
Jobs
TagsGame Engines

Problems 9 & 10: Directed/Undirected Hamiltonian Circuit

A topic by procmeal games created Sep 06, 2022 Views: 69
Viewing posts 1 to 1
HostSubmitted

Given a graph G, a Hamiltonian circuit (a.k.a. Hamiltonian cycle) is a circuit that visits every vertex exactly once.  This problem is to find a Hamiltonian circuit or determine that there are none.

The only difference between the 2 problems is that problem 9 is a directed graph, and problem 10 is an undirected graph.

Here's a video: https://youtu.be/AamHZhAmR7o