Implementation of graph theory algorithms from scratch using python

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

This project is a homework assignment on probabilistic techniques and randomized algorithms. It involves problems related to random graphs, Ramsey theory, graph colorings, k-SAT, Markov chains, and random walks. The tasks require proving statements, finding probability distributions, and analyzing convergence properties in probabilistic models.

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