A question in line 193

[skfzyy]

Hi,first of all, thanks very much that your code help me solving a big problem.
At the same time,I have some issue which bother me for a long time. the line 193 judge "L.vertex[w].d < L.vertex[w].f",but in aforementioned part, the DFS scan the graph and the vertex.f should definitely larger than vertex.d, so I wander why there is a judgement?
thanks again and look forward to your reply.

[ricelink]

Here are therr resources may help you: 1. #https://github.com/mmozolin/FindingAllSpanningTrees/blob/master/FindAllSpanningTrees/main.cpp 2. #reference: Gabow, H. N., &amp; Myers, E. W. (1978). Finding all spanning trees of directed and undirected graphs. SIAM Journal on Computing, 7(3), 280-287. &nbsp; 3.Proposition 4 in&nbsp; https://ieeexplore.ieee.org/abstract/document/8793216

…

------------------&nbsp;原始邮件&nbsp;------------------ 发件人:&nbsp;"skfzyy"<notifications@github.com&gt;; 发送时间:&nbsp;2020年5月18日(星期一) 下午2:01 收件人:&nbsp;"ricelink/finding-all-spanning-trees-in-directed-graph"<finding-all-spanning-trees-in-directed-graph@noreply.github.com&gt;; 抄送:&nbsp;"Subscribed"<subscribed@noreply.github.com&gt;; 主题:&nbsp;[ricelink/finding-all-spanning-trees-in-directed-graph] A question in line 193 (#1) Hi,first of all, thanks very much that your code help me solving a big problem. At the same time,I have some issue which bother me for a long time. the line 193 judge "L.vertex[w].d < L.vertex[w].f",but in aforementioned part, the DFS scan the graph and the vertex.f should definitely larger than vertex.d, so I wander why there is a judgement? thanks again and look forward to your reply. — You are receiving this because you are subscribed to this thread. Reply to this email directly, view it on GitHub, or unsubscribe.