/Shortest-Path-and-Network

Program that calculates the smallest network and shortest path in a graph of networks

Primary LanguageC++

##Shortest Path and Network

Run:

>>> make
>>> ./netplan <inputfile>

##Overview:

This program finds you the shortest path in an undirected graph using Dijkstra’s algorithm, tells you the total cost of constructing links between all networks in original graph, and as well the lowest cost of all networks by using Prim’s algorithm