andrewb330/euclideanmst

Implementations of different algorithms for building Euclidean minimum spanning tree in k-dimensional space.

Maybe I will post something useful here... sometime 🙈

euclideanmst's Issues

Can't run example.cpp

Hi, I'm trying to run your example.cpp file but I am getting a ton of errors when I try to compile it. Can you please check that it is functioning?

Thanks!

shadows template parameter

Hello andrew,

Tried to run your code but i faced this issue.

//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
$ g++ main.cpp -o binary
In file included from emst.h:2:0,
from main.cpp:9:
model.h:21:14: error: declaration of template parameter ‘DIM’ shadows template parameter
template<size_t DIM>
^~~~~~
model.h:9:10: note: template parameter ‘DIM’ declared here
template<size_t DIM>
^~~~~~
model.h:69:14: error: declaration of template parameter ‘DIM’ shadows template parameter
template<size_t DIM>
^~~~~~
model.h:47:10: note: template parameter ‘DIM’ declared here
template<size_t DIM>
^~~~~~
//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

Possible Variation

Is it possible to find Euclidean Maximum Spanning Tree using this code?

Also, are you sure that it's time complexity is NLogN? Because on my local machine a code with 2e5 points in 3-4 dimension is taking forever to finish

I am attaching the test data i used

[TEST DATA]
and it took 115322ms for the execution

For an algorithm with time complexity of N*log(n), i expected a execution time around 3 seconds
Can please you help a little, i need it for a task?