Explore method to find shortest path through a cluster of points

1. Create adjacency matrix
2. Use Prim's algorithm

Nodes are the VPs from SPS file: line, station, easting, northing

References:
https://codedamn.com/news/programming/introduction-to-adjacency-matrix-for-graphs
https://favtutor.com/blogs/prims-algorithm-python
https://stackoverflow.com/questions/71232076/deriving-an-adjacency-matrix-wrt-distance
https://www.mathworks.com/help/matlab/ref/graph.distances.html
https://stackoverflow.com/questions/25585401/travelling-salesman-in-scipy
https://stackoverflow.com/questions/71196078/scalable-implementation-of-the-travelling-salesman-problem-in-python/71196079#71196079
https://pypi.org/project/python-tsp/
https://pypi.org/project/fast-tsp/
https://github.com/jvkersch/pyconcorde
https://pypi.org/project/tsp-solver2/ (recommended)


CSV
https://www.gormanalysis.com/blog/reading-and-writing-csv-files-with-cpp/ (read and write csv)

matplotlibcpp17
https://soblin.github.io/matplotlibcpp17/