Adjacency List Project

This project highlights my work studying adjacency lists. An adjacency list is a graph that uses a hash map to locate the graph’s vertices. Within the vertices on the hash map, there exists the name of the vertex itself, and a linked list representing its neighbors with the corresponding weights. Object-oriented programming is used to add and delete both directed and undirected edges.