Register

Recent posts tagged nit

1
NIT Trichy Interview Experience List
A) Do following for every vertex u in topological order.………..Do following for every adjacent vertex v of u………………if (dist[v] dist[u] + weight(u, v))…�...
User Avatar
2
Guidance for the failure
$2(n-1)$ the spanning tree will traverse adjacent edges since they contain the least weight.
User Avatar
3
NITW vs IITH
no. It asks for "NOT" supported in HTML
User Avatar
To see more, click for the full list of questions or popular tags.