I have tried the code for a directed graph with 1 and only 1 unspecified root. That is to say, we only know its existence, but we don't know which one it is.
I have tested for some simple graphs, it seems the source node for the first edge is always the root node. Is my assumption right?
I have tried the code for a directed graph with 1 and only 1 unspecified root. That is to say, we only know its existence, but we don't know which one it is. I have tested for some simple graphs, it seems the source node for the first edge is always the root node. Is my assumption right?