User:Extra999/Notes

For any two vertex a and b, the path between them in MST of graph is the path with the minimum cost, where cost is defined as the maximum weight of all edges in a path. (This is because Kruskal's algorithm will choose the path with the least maximum edge first.)