portfolio project for data structures, working with graphs
This assignment is comprised of 2 parts. In the first part, you will complete the implementation of a undirected graph ADT where the vertices and edges should be stored as an adjacency list. In the second part, you will implement a directed graph ADT where the vertices and edges should be stored using an adjacency matrix.
Specifications: https://github.com/gelafin/data-structures-portfolio/blob/main/CS261%20Programming%20Assignment%206%20-%20v1.02.pdf