Computing classes of maximal path-equivalent nodes in a rooted DAG

Question

I have a rooted directed acyclic graph with a single root node r. I\'m interested in computing the following equivalence:

"Nodes v and w are maximal path-equival