Introduction Graph Algorithms - Memory Requirements Estimation - Question 1: Memory Requirements Estimation

Question 1: What algorithms can you estimate heap memory for?

There are four options:

  • Betweenness Centrality
  • Closeness Centrality
  • PageRank
  • Label Propagation

If I'm correct, estimations can be made on both the loading and the algorithms.
So I checked all 4 options.

What am I missing?

Hello @s95wtyyht6zk

This question is based upon a previous release of GDS where the correct answers are all but Closeness Centrality. The questions is about estimating algorithms, not loading.

We will update the course (and the question) to the latest release of GDS. In the latest release all algorithms, but the ones relating to Link Prediction, can be estimated.

Thanks for picking this up as an issue.


Actually the definitive answer about what algorithms can return estimates can be found here where you can see which ones have the estimate methods.


Hi Eliane,

Thank you for your answer.

When following the course pages, how should a course participant this information. It was never mentioned before in the course as far as I can remember.

Would be nice when the questions are related to the course material.

I have updated the course and the question so hopefully there is no more confusion.


Thanks for the update and the quick response!

Great to see that the course are kept alive!