Ths repository contains the base codes of various algorithms in C.
- BFS - Breadth First Search Algorithm - Shortest Path from a source to all vertices in an unweighted graph (Lists)
- Dijkstras' Algorithm - Shortest Path from a source to all vertices in a (positive) weighted graph (Min Heap + Lists)
- Representation of graphs using adjacency list
- Heaps - An array implementation of a Max Heap
- Kruskals ALgorithm to find the minimum spanning tree of a graph using Disjoint Subsets