python new test framework is required. updated in this fork

python: function name should be snake_case

Note that if node 0 is connected to node 1, node 1 is also connected to node 0. This will always be true.

This is not always true. In fact, from the sample tests:

                                      |¯¯¯¯¯¯¯¯¯| where is 1?
                                      v         v
test.assert_equals(isTree([[1,2,3],[0,2],[1,2],[0]]), False)
                              ^           ^^^
                              |____________| where is 0?

The wording is either misleading (if such a case needs to be checked) or otherwise plain wrong.

Nope. But you can submit a new one.

Would there be way to remove solutions that had passed the tests previously but no longer do?
I would certainly like to retract mine.

all done.

Also, please add [[1,2],[0,2],[0,1],[4],[3]] i.e. ring of 3 plus two more connected to each other

No problems, I'm on it.

The current top solution still doesn't account for more than one connected components, and it only fails random tests very occasionally.

Shouldn't tests like [[1,2],[0,2],[0,1],[]] be put on the fixed tests?

Fixed! (Only took 2 months)

Gotcha, thanks. Well then this folds into Blind4Basic's point below about needing tests with unconnected graphs.

what are E and V?

Hi,

Don't resolve to fast: about random tests, that's not enough. ;)

• increase the number of tests to 100
• it seems that your random generator when it doesn't create a tree, creates only graphs with closed paths and never unconnected ones only (meaning, the condition that checks that all nodes have been traversed is always true).