Program uses three different algorithms for finding the (MST) (SPT) in a graph: Prim's algorithm, Dijkstra's algorithm, and Kruskal's algorithm (including BFS and DFS). Provides visual representations of the graphs and their corresponding trees or paths.