Skip to main content
Figure 1 | BMC Bioinformatics

Figure 1

From: Fast network centrality analysis using GPUs

Figure 1

Pseudo-code for computing betweenness centrality on GPU. Lines 1-25 implement the main function that is executed on CPU. Code between lines 26-39 is the kernel function that carries out the All-Pairs Shortest Path algorithm. Lines 40-55 implement the back propagation where the final values of betweenness centrality for each node are set.

Back to article page

BMC Bioinformatics

ISSN: 1471-2105

Contact us