This is a C++ implementation of a graph, Dijkstra's shortest path algorithm using the STL's priority_queue container adapter to implement a priority queue which allows us to change the priority of the items in the queue, and a Monte Carlo simulation as a way of testing these.<br><br>

More detailed description and road map, plus license:<br>
&nbsp;&nbsp;&nbsp;<a href="license">license</a><br>
&nbsp;&nbsp;&nbsp;<a href="README">README</a><br><br>

An abstract base class for a graph <i>G = (V, E)</i>:<br>
&nbsp;&nbsp;&nbsp;<a href="Graph.h">Graph.h</a><br><br>

A concrete implementation of a Graph that uses an adjacency list (rather than an adjacency matrix):<br>
&nbsp;&nbsp;&nbsp;<a href="GraphImpl1.h">GraphImpl1.h</a><br>
&nbsp;&nbsp;&nbsp;<a href="GraphImpl1.cpp">GraphImpl1.cpp</a><br><br>

The rest:<br>
&nbsp;&nbsp;&nbsp;<a href="Makefile">Makefile</a><br>
&nbsp;&nbsp;&nbsp;<a href="main.cpp">main.cpp</a> - the Monte Carlo simulation is here.<br>
&nbsp;&nbsp;&nbsp;<a href="PriorityQueue.hpp">PriorityQueue.hpp</a><br>
&nbsp;&nbsp;&nbsp;<a href="Dijkstra.cpp">Dijkstra.cpp</a><br>
&nbsp;&nbsp;&nbsp;<a href="Dijkstra.h">Dijkstra.h</a><br><br>