Dijkstra’s Algorithm and Shortest Path
Dijkstra’s algorithm finds the shortest path from the source node to all other nodes where all edge weights are non-negative by using min-heap.
Blog
2026
Union-Find Algorithm and Minimum Spanning Tree
Union-Find algorithm also known as Disjoint Set Union (DSU) manages a collection of elements split into non-overlapping sets. It is highly efficient for trac...
Topological Sort
Topological Sort is linear ordering of vertices in a directed graph such that for every directed edge from vertex u to vertex v, u comes before v in the orde...
Traversing Graphs
There are two main ways to traverse a graph: Add a vertex to stack/queue, and pop from it and add the neighbors to the stack/queue. Stack will result in D...
2022
Building GitHub Pages using Docker
This website is built using Jekyll with Minimal Mistakes theme and hosted on GitHub Pages. To run the website locally, one needs Ruby, RubyGems and Jekyll. R...
2019
Writing on Github
It’s a template post presenting different writing styles/features that can be used in github repositories and pages. Most of the examples are from Github - B...