Is there a way to tweak the existing connected components algorithms (WCC & SCC) to compute unilaterally connected components?
The difference between each of them can be seen here:
Nice question. Maybe just look and see if there is a spanning tree that is directed (i.e. , directed away from a single vertex)?
On November 16 and 17 for 24 hours across all timezones, you’ll learn about best practices for beginners and experts alike.