[NSWI080] Task 1 - Java RMI - Update

[Vlastimil Dort]

Dear students,

I updated the first task (Java RMI) with the recommended graph sizes, 
and fixed a small bug in the transitive algorithm.

Due to the updates, the deadline for the task is shifted by one week to 
*23rd March*. All other deadlines remain unaffected.

*Transitive algorithm bug*

It has been reported that the transitive algorithm provides a wrong 
answer in the case when the source and destination are the same node.

This has been fixed in the provided code, by checking for this situation 
at the top of  SearcherImpl.getDistanceTransitive. You can copy this 
check into your code.

*Graph sizes*

To see the differences between the five variants, it is best to try 
increasing the number of nodes and look separately at dense and sparse 
graphs. The following parameters are the recommended graph sizes. You 
can choose different parameters, as long as the differences between the 
variants are apparent in the results.

  * For *sparse* graphs, generate graphs with number of nodes ranging
    from 100 to 1000 in steps of 50, with number of edges being *three
    times* the number of nodes. For each size, run at least 10 searches.
  * For *dense* graphs, generate graphs with number of nodes ranging
    from 100 to 700 in steps of 50, with number of edges being *a
    hundred times* the number of nodes. For each size, run 10 searches.

When making the comparison chart for the five variants, you can make two 
separate charts, one for sparse and one for dense graphs.

Vlastimil Dort
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://d3s.mff.cuni.cz/pipermail/nswi080/attachments/20230316/0360c1be/attachment.htm>