 |
.. (לתיקייה המכילה) | |
General: Are the signature of the functions 'take' and 'drop' on the 'List' slides wrong? | |
|
Yes, the signatures are opposite (the 'a list comes first). Indeed if you run 'List.take' or 'List.drop' in ML you will get: val it = fn : 'a list * int -> 'a list and not as written in the slides. |
Question 2: Can there be circular routes in the graph? | |
|
Yes. The description in the assignment is ambiguous and will be updated. This means that there can be a route from node v to itself that is not a self-circle. However, there exists a self-circle for node v iff there exists the edge (v,v). |
General: may we ignore "Warning: calling polyEqual" warnings? | |
|
Yes. This warning doesn't indicate any real problem with the code. |
Question 3: What should be returned if we get an empty list as an input? | |
| You can assume that N is positive, so the empty list is not a legal board, and 'false' should be returned. |