Minimum cost connection solution
Enter the undirected node connection cost and find the lowest total cost connection set that covers each connected component.
Minimum cost connection solution User manual
- Fill in the parameters or select the file according to the form, and check the unit and format first.
- When A-B cost 4, A-C cost 1, B-C cost 2, the last two connections are selected.
- Click the processing button to view the results, you can copy or download and save.
Calculation method and processing rules
Kruskal's algorithm sorts edges by cost and skips cycles, producing a minimum spanning tree or a minimum spanning forest for a disconnected graph.
scope of use
Up to 80 nodes and 500 edges, non-negative integer costs; the draw scheme may not be unique, and the disconnected graph cannot be falsely called all connected.
Will the input content be saved on the server?
This tool handles input in the browser, and does not upload files or form content. Typing practice scores are only saved in the native browser.
Why may the result be different from other tools?
Up to 80 nodes and 500 edges, non-negative integer costs; the draw scheme may not be unique, and the disconnected graph cannot be falsely called all connected. Please compare the input unit, rounding method, applicable rules and data version first.