/cpp_Greedy

A Monte Carlo simulation that calculates the average shortest path in a graph.

Primary LanguageC++

cpp_Greedy

(implemented class Graph, MinHeap, Dijkstra's Algorithm and Prim's minimum Spanning Tree from scratch)

A Monte Carlo simulation that calculates the average shortest path in a graph.

(commented out:)

The graph can be generated using a pseudo-random number generator to produce edges and their costs. The shortest path algorithm will be Dijkstra’s

Prim's minimum spanning tree

Graph can be passed as file

exapmle: g1.txt

Implemented in C++

Somewhat detailed skeleton of the project