**Problem Source:** UVA Online Judge - 567

**Brief Analysis:** As a first problem of Floyd-Warshall, a very straight-forward problem chosen. Just read and code.

**Problem Source:** UVA Online Judge - 10986

**Brief Analysis:** As a first problem of Dijkstra, a very straight-forward problem chosen. Just read and code.

**Problem Source:** UVA Online Judge - 10067

**Brief Analysis:** It could be easily identified this is a BFS problem. Only one optimization here is to build graph first time before running any test case. Building graph for each test case could get TLE verdict.

Solving graph problems for newbies was never been easy. In this series of blog, I am going to delineate solutions of graph problems precisely taken from several online judges which will help newbies to solve graph problem from easy to hard categories. Although It's good to have a theoritical backgro...