Skip to main content

Table 3 Recommendations for V, E, and adj depending on workload and computed metric

From: Compile- and run-time approaches for the selection of efficient data structures for dynamic graph analysis

Metric Constant workload (MD) Non-constant workload (FB)
  V E adj V E adj
All-pairs shortest paths A HM AL HAL HAL LL
Assortativity A HM A HAL HAL A
Betweenness centrality HAL HM AL LL HAL LL
Clustering coefficient A HM A HAL HAL AL
Degree distribution A HM A HAL HAL AL
Rich-club connectivity A HM AL HAL HAL AL
Connected components A HM AL HAL HAL AL