Project Description

This project is a visualization to help understand Dijkstra’s algorithm for finding the shortest path and Kruskal’s algorithm for minimum spanning tree. The program generates a random graph for which the user can find the minimum spanning tree or compute the shortest path between any two nodes.