10 8 Computing Strong Components The Analysis 26 min

[@pm682]

Does using the finishing times of G by ascending order has the same effect of using finishing times of G_rev in descending order? Just curious if its necessary to compute G_rev?

[@luojihencha]

No, it does not have a same effect, using ascending order of G does not guarantee that the sink SCC has higher value assigned, because sink SCC can be visited first

[@victor.ezekiel]

Also, how do we implement selecting paths because the algorithm intentionally prioritises paths within the SCC.

[@victor.ezekiel]

Never mind. I implemented it myself and its independent of the path taken at each node as long as you explore all paths in the directed graph.

[@victor.ezekiel]

Dear Dr. Tim, you didn't proof case2 the same way you did case2.

[@vermoidvermoid7124]

How does c4 has the largest finishing time? It's the sink scc , which means it's the smallest finishing time

[@sjx2321]

The finishing time was generated by the reversed graph.

[@hanjiedeng2910]

C4 has the largest finishing time in the reversed Graph.