A complete web tool for graph theory. It solves the Dijkstra, Floyd–Warshall, and MST (Kruskal) algorithms and analyzes structural properties via adjacency matrices. Includes dynamic visualization and import/export options.

Solucionador de Árvore Geradora Mínima em C++ que lê grafos no formato TSPLIB e aplica o Algoritmo de Kruskal, para a disciplina de Teoria dos Grafos 2018.1.

Implementation of MST algorithm (Prim and Kruskal) and shortest path algorithm (Dijkstra and Bellman-Ford)