Implementation of graph theory algorithms from scratch using python

Graphx · Shortest Hamiltonian Path in a Complete Graph · Java, JavaFX, JFoenix

Semiannual project of the subject of Graph Theory, taught at Centro Universitário FEI. It consists of reading a file that contains a matrix, which represents a graph. From its reading, certain information about the graph is displayed.

Accepts number of peaks as user's input, constructs the complete graph Kn and returns the Euler cycle if one exists