Mahmoud Adel
Mahmoud Adel
Hello, I think I have an idea for a O(|V| + |E|) algorithm but I am not sure it's 100% correct. if the graph is a DAG, I think we...
I would like to work on the issue even if my solution turned to be incorrect. That's of course in case you decided to move forward with the O(|V|^2) solution
@philberty do you have any idea why it's failing? I think it's overflowing somewhere but I can't figure it out.
Btw, this implementation also handles the path-to-tuple scrutinee and nested tuples. Added tests for that.