About

This is the final project for my Data Structures-II Course in university. In short, what's required is to implement Prim’s algorithm to find the Minimum Spanning Tree and find the shortest path using Dijkstra’s Algorithm.

Stars

Watchers

Forks