This is a project is one that I completed my sophomore year at Gordon College in a Data Structures and Algorithms course written by a team in C++. The project creates an adjacency matrix based on given input information of a network of vertices. Operations are performed on this adjacency matrix using Depth-First Searches and Breadth-First Searches. Operations performed include calculating shortest paths from an initial vertex to all other vertices, find the minimum cost spanning tree, and using recursion to find connected components.