3 ms·

You must add a loop to find any nodes that have not been visited at all: the graph might not be fully connected. This is always the case in a directed acyclic g

by rjprins 18y ago

You must add a loop to find any nodes that have not been visited at all: the graph might not be fully connected. This is always the case in a directed acyclic graph.