Java Euclidean MST Solver
Budget: €8 – €30 EUR
I need a compact Java program that builds a Euclidean Minimum Spanning Tree. All point data will be read from a single .java file that I will supply; think of it as a stub containing an array or list of coordinates rather than a classic data file. Your job is to parse those coordinates directly and output the MST edges and total weight.
Key points
• Input source: read the points from the provided .java file (no CSV, JSON or TXT).
• Algorithm is up to you—Kruskal, Prim, or any well-known Euclidean approach—as long as it returns the correct minimum spanning tree for any 2-D set I give you.
• Deliverables: the runnable Java class(es), brief compile/run instructions, and a short read-me explaining the chosen algorithm.
• Fixed budget: €10 total, so please keep the solution lean and straightforward.
* don't use ai
If the program compiles with javac, runs from the command line, and prints the MST edges in a clear format, I will release payment immediately.
Key points
• Input source: read the points from the provided .java file (no CSV, JSON or TXT).
• Algorithm is up to you—Kruskal, Prim, or any well-known Euclidean approach—as long as it returns the correct minimum spanning tree for any 2-D set I give you.
• Deliverables: the runnable Java class(es), brief compile/run instructions, and a short read-me explaining the chosen algorithm.
• Fixed budget: €10 total, so please keep the solution lean and straightforward.
* don't use ai
If the program compiles with javac, runs from the command line, and prints the MST edges in a clear format, I will release payment immediately.