Reachability Let G D .V; E/ be a directed graph in which
Chapter 22, Problem 22-4(choose chapter or problem)
Reachability Let G D .V; E/ be a directed graph in which each vertex u 2 V is labeled with a unique integer L.u/ from the set f1; 2; : : : ; jV jg. For each vertex u 2 V , let R.u/ D f 2 V W u g be the set of vertices that are reachable from u. Define min.u/ to be the vertex in R.u/ whose label is minimum, i.e., min.u/ is the vertex such that L./ D min fL.w/ W w 2 R.u/g. Give an O.V CE/-time algorithm that computes min.u/ for all vertices u 2 V .
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer