Structs

A graph data structure represented as an adjacency list.

Functions

Performs Dijkstra’s algorithm on a given directed graph represented as an adjacency list. Prints a vector of vectors, where each inner vector contains the nodes of dijkstras in sorted order.