• COMP26120 (Algorithms) - Clarification on final lab exercise

    Published: Friday, 28 April 2017

    COMP26120 (Algorithms) - Clarification on final lab exercise

    COMP26120 (Algorithms) - Clarification on final lab exercise:

    Several students have pointed out that, in the final lab exercise, where you are asked to check the "small world hypothesis" by calculating the "degrees of separation" of nodes in a graph, the example graph has multiple components. You should calculate the degrees of separation (distances = shortest path lengths) in the largest of the connected components of the graph, or, if you wish, the maximum distances between pairs of nodes within all the components. I hope that is clear now. 

    gravatar David Rydeheard
Generated: Tuesday, 17 October 2017 06:55:34
Last change: Friday, 28 April 2017 12:47:37
▲ Up to the top