How to visualize reachable nodes in a directed acyclic graph
Posted: 12 Aug 2016 10:00
Hi all,
I'm trying to create a filter that only visualizes vertices/edges that are reachable from vertice X, in a directed acyclic graph.
I tried using the Ego Network filter, but unfortunately it also includes vertices/edges that are going IN vertice X (his parents in the tree) and these are in no way reachable from it.
Is there a way to achieve that?
Best regards,
Marin
I'm trying to create a filter that only visualizes vertices/edges that are reachable from vertice X, in a directed acyclic graph.
I tried using the Ego Network filter, but unfortunately it also includes vertices/edges that are going IN vertice X (his parents in the tree) and these are in no way reachable from it.
Is there a way to achieve that?
Best regards,
Marin