This code is a different implementation of the shortestPathTree algorithm published yet. The main difference here is that I used only arrays and a mine quicksort function, because I need to port this code into VB.NET to make a performance comparison without using built-in sort or specific framework containers. 

This code is slower compared to the original implementation, so don't use it but you want to port to another language for sake of comparison again. On my machine the VB.NET implementation of this code is 1.75 time slower than the C++ one.