 |
.. (לתיקייה המכילה) | |
In question 1, can we assume that we know the parameter n when we call Init? | |
| Yes. |
In question 1, is n considered constant for complexity matters? | |
| No. |
In the WORD version of Dry3 there are answers to some of the questions. Do we need to submit the answers to these questions? | |
| No, you don't. Try to solve these questions alone, and use our answers to check yourselves. |
For dry3, may we assume that allocating memory (using malloc for example) takes O(1) time regardless of the amount of memory allocated? | |
| Yes. |
In Q4 part A: what exactly is the output of the algorithm? | |
|
The algorithm prints the egdes of the MST (as triples of the form (v,u,w) where v and u are nodes and w is the weight of the edge between them). In the case where there is no MST (i.e. the graph is not connected) the algorithm should return a message about it instead. |