Implementation of various basic data structures and algorithms.
Implementation of sorting algorithms like Heap sort, Insertion Sort, and Merge sort
Implementation of traversing graph algorithms like Breadth first search and Depth first search as well as topological ordering of directed acyclic graphs (DAGs)
Implementation of shortest paths algorithms in a graph. These implementation find the shortest path between a source node and every other reachable node in the graph and keep track of these shortest paths. E.g. Bellman Ford algorithm and Dijkstra.