3 ms·
I would say the easiest way is to walk the graph and tag the nodes as visited. If you don't visit every node each iteration use a increasing key you store in ea
by rightbyte 4y ago
I would say the easiest way is to walk the graph and tag the nodes as visited. If you don't visit every node each iteration use a increasing key you store in each node.