(load WASM…)
Algorithm: Prim's MST with priority-queue, exactly the C++ in src/graph.cpp::prims(), compiled with Emscripten. Input format: first line is vertex count; second line is edge count; then one edge per line as a b weight.
a b weight