Create kosaraju_algo.py

[techyshiv]

Provide code for issue #11677

Describe your change:

To find the Strongly Connected Components (SCCs) in a directed graph, we can use Kosaraju's Algorithm. This is a two-pass DFS-based algorithm that works efficiently with a time complexity of O(V + E), where V is the number of vertices and E is the number of edges.

Kosaraju's Algorithm Steps:

1. First DFS Pass: Perform a DFS and push each vertex onto a stack in the order of their finishing times.
2. Transpose the Graph: Reverse all the edges in the graph.
3. Second DFS Pass: Pop vertices from the stack, and for each vertex, perform DFS on the transposed graph to identify all the vertices reachable from that vertex (this gives an SCC).

• Add an algorithm?
• Fix a bug or typo in an existing algorithm?
• Add or change doctests? -- Note: Please avoid changing both code and tests in a single pull request.
• Documentation change?

Checklist:

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized.
• I know that pull requests will not be merged if they fail the automated tests.
• This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• All new Python files are placed inside an existing directory.
• All filenames are in all lowercase characters with no spaces or dashes.
• All functions and variable names follow Python naming conventions.
• All function parameters and return values are annotated with Python type hints.
• All functions have doctests that pass the automated testing.
• All new algorithms include at least one URL that points to Wikipedia or another similar explanation.
• If this pull request resolves one or more open issues then the description above includes the issue number(s) with a closing keyword: "Fixes #ISSUE-NUMBER".

[algorithms-keeper]

Closing this pull request as invalid

@techyshiv, this pull request is being closed as none of the checkboxes have been marked. It is important that you go through the checklist and mark the ones relevant to this pull request. Please read the Contributing guidelines.

If you're facing any problem on how to mark a checkbox, please read the following instructions:

• Read a point one at a time and think if it is relevant to the pull request or not.
• If it is, then mark it by putting a x between the square bracket like so: [x]

NOTE: Only [x] is supported so if you have put any other letter or symbol between the brackets, that will be marked as invalid. If that is the case then please open a new pull request with the appropriate changes.