# Dijkstra-s-Shortest-Path-and-Kruskal-s-MST-Algorithm-C-
Implementing Dijkstra’s Shortest Path and Kruskal's Minimum Spanning Tree Algorithms using C++11. Including a random graph generator and graph generator with file input.

You can see the samplegraph.txt in order to see how to write your own graph.

First line --> Vertex number

Following lines (a b c):
a --> Vertex
b --> Vertex
c --> The edge weight between the two vertex a and b