MSTNone

MSTNone typically refers to a scenario in graph theory or algorithms where no minimum spanning tree (MST) exists. A minimum spanning tree is a subset of edges connecting all vertices in a weighted graph with the least total weight. If MSTNone occurs, it indicates that the graph is disconnected, meaning there are at least two parts that cannot be linked together, making it impossible to create a single cost-effective spanning tree that covers every node. Essentially, MSTNone signals that a complete, lightweight network connecting all points cannot be formed due to the graph's structure.