There is a Graph G(V,E). All nodes and edges are numbered. Two edges can have same number but all nodes have a unique number.
A path $ v_1, v_2,v_3,...,v_k $ exists if and only if the edge connecting the nodes in the path is in increasing order. I am interested in finding the maximum valued reachable node for each node in the graph.
I have thought of doing Depth First Traversal starting from the highest valued node and marking all those that can visit this node, and so on. But using this approach, we must visit a node more than once.