implement and analyze two fundamental graph algorithms

The purpose of this project is to implement and analyze two fundamental graph algorithms: the Minimum Spanning Tree (MST) and the Shortest Path algorithm.