[ALGO] Kosaraju's Algorithm

[toadkarter]

Implements #115

☑ The algorithm is implemented
☑ The new function has a javadoc-style comment explaining the interface
☑ Appropriate tests are added under test/graaflib/algorithm/strongly_connected_components/kosarajus_test.cpp
☑ A test coverage of at least 95% is reached
☑ A documentation entry is added under docs/docs/algorithms under the appropriate category. Just adding a short description and the algorithm syntax here is fine. See the wiki on how to build the documentation locally
☑ The algorithm is added to the list of algorithms in README.md

I should flag here that I decided to use a simple recursive DFS - the one that was already in the library seemed (unless I am mistaken) more geared towards searching through edges as opposed to vertices. However, if the library implementation of DFS is required please do let me know and I can work it into the existing code.

[codecov]

Codecov Report

All modified lines are covered by tests ✅

Files	Coverage Δ
...gorithm/strongly_connected_components/kosaraju.tpp	100.00% <100.00%> (ø)
...algorithm/strongly_connected_components/tarjan.tpp	100.00% <100.00%> (ø)
...hm/strongly_connected_components/kosaraju_test.cpp	100.00% <100.00%> (ø)
...ithm/strongly_connected_components/tarjan_test.cpp	100.00% <100.00%> (ø)

... and 6 files with indirect coverage changes

📢 Thoughts on this report? Let us know!.

[bobluppes]

Thanks for working on this!
Looks quite good already, was just thinking about a possible issue regarding the order in which we add vertices to the set in the first DFS.

[toadkarter]

Thanks for working on this! Looks quite good already, was just thinking about a possible issue regarding the order in which we add vertices to the set in the first DFS.

Thanks very much for the review! All of these suggestions look great and I will try to implement them when back from work today.

[bobluppes]

Thanks for working on this! Looks quite good already, was just thinking about a possible issue regarding the order in which we add vertices to the set in the first DFS.

Thanks very much for the review! All of these suggestions look great and I will try to implement them when back from work today.

Thanks a lot and no rush 👍🏻

[bobluppes]

Looks excellent 🎉

[bobluppes]

👍🏻 very nice that we now have this. Also thanks for updating Tarjan!

[bobluppes]

Also nice that we are now using these scenario's in the tests! I would like to start using them more throughout the codebase