[UVA][dfs, 窮舉] 140 - Bandwidth
Bandwidth
Given a graph (V,E) where V is a set of nodes and E is a set of arcs
in VxV, and an ordering on the elements in V, then the
bandwidth of a node v is defined as the maximum distance in the
ordering between v and any node to which it is connected in the...
