Given an weighted directed tree, I have to write this:
Given a vertex v
, I should list all the vertex c
such that there exist a path
whose origin is in c
and whose end is in v
Given a vertex v
, I should list all the vertex c
such that there exist a path
whose origin is in v
and whose end is in c
What is the easiest way to do this in Mathematica?
Thanks very much.