Distances in and Layering of a DAG

Bhadrachalam Chitturi, Priyanshu Das

The diameter of an undirected unweighted graph $G=(V,E)$ is the maximum value of the distance from any vertex $u$ to another vertex $v$ for $u,v\in V$ where distance i.e. $d(u,v)$…