atofigh / edmonds-alg

Implementation of maximum branching algorithm (max spanning tree in directed graphs)
MIT License
25 stars 4 forks source link

is root node the source node for the first edge? #2

Open amber2018 opened 6 years ago

amber2018 commented 6 years ago

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?

amber2018 commented 6 years ago

sorry, I have tried more graphs, it turns out root node can be any other nodes.