Help Needed in Kosaraju's Algorithm

Revision en1, by dgupta0812, 2020-08-27 21:51:46

Hello everyone !!

Recently I was learning the Kosaraju's Algorithm for finding SCC's and after having learnt about it, I was wondering if we could traverse the transpose of the graph without actually reversing the edges (i.e., creating a new adjacency matrix). I couldn't come up with any solution so can anyone share their thoughts on how it can be done ?


  Rev. Lang. By When Δ Comment
en1 English dgupta0812 2020-08-27 21:51:46 394 Initial revision (published)