see issue above, please.

Approved.

Java translation

rewrote the description

the graphs are directed. going from A to B is not the same as going from B to A

all done except big cyclic graphs

Reraised as issue

No random tests in CS

When a = "011" and b = "01",your solution compared them as 0 vs 0 and 1 vs 1 but it should be 0 vs 0, 0 vs 1 and 1 vs 1 (011 & 001)

Seriously ?! 7kyu ?

• Node 12 should be enabled (Refer this and this for more info)

• Python new test framework should be used (Refer this & this for more detail)

• Ruby 3.0 should be enabled (Refer this & this for more detail)

Raising about the elephant in the room, since FArekkusu seems to be missing the almost obvious...

• edges can be undefined. That's bad, and that's not said. Edges should be an empty array by default
• nodes is reassigned along the way, and used as a global var. That's bad too. Moreover when one considers that the user has absolutely no use for it. The tests should be rewritten without that or at least without it being "visible" to the user.
• the node class should be in preloaded or even in the tests themselves
• inputs aren't properly described in... the description. Just be explicit, you're sort of at two words of the appropriate sentence...

suggestion:

Tests with big cyclic graphs should be added, to check that the user is actually keeping track of what he does (ie. implement an algo that can terminate...). That would be a bit more appropriate considering the rank.

cheers

No random tests.