arnaud-m / Programming-Challenges

Course Lectures

Home Page:http://i3s.unice.fr/master-info/s1/programming-challenge/

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

PT07Y - Is it a tree - Complete test cases

arnaud-m opened this issue · comments

The test cases are really weak : they likely have a regular structure.
My guess is that the edge list is generated by a traversal.
Some very wrong programs pass the test.

Some test cases with simple traps must be designed.

4 3
1 2
3 4
2 3

Some randomized test cases could also be added: a randomly ordered edge list with randomly ordered nodes.