This module serves as a graph library that enables to handle undirected weighted graphs (directed is in the works) in memory. It features simple operations such as adding and removing nodes and edges and finding the shortest path between nodes

The prioriy queue is used by the shortest path algorithm of the Graph module. It keeps all the nodes that are to be evaluated and determines which node is to evaluated next. As the name suggests it works as a queue. So the main methods are push for adding an entry and pop for getting the next one

This module is used for quick and easy testing of the different functions. Feel free to edit it