Graph-Algorithms

Implementation of several graph algorithms

1. Implementation of Prim's algorithm using minheap for edge selection by storing the graph in adjacency matrix.

2. Implementation of Prim's algorithm using minheap for edge selection by storing the graph in adjacency list.

3. Implementation of Krushkal's algorithm using minheap for edge selection by storing the graph in adjacency matrix.

4. Implementation of Krushkal's algorithm using minheap for edge selection by storing the graph in adjacency list.