Grafos e Ciclos Hamiltonianos

This app solves the hamiltonian cycle problem for a given graph. The problem is to find paths in a directed graph of n vertices, starting from a starting point, visiting all the vertices only once and returning to the starting point. This is known as an NP-complete problem and no efficient solution is known in general. From a programming teaching point of view, I provide a solution for small graphs with six or fewer vertices, along with an easy-to-use user interface.

Basically, it looks for all possible paths, but the method is not so trivial and you need to think through the procedure. The use of various lists and recursive functions in the implementation of the algorithm is useful for improving programming capabilities. You should also consider the graphical user interface for configuring and displaying graphics. The sense of accomplishment gained from completing this app adds to the educational effect. It's also fun to run the finished application and see the results on the graph.