Maximum spanning tree
= Maximum spanning tree
{title2=$\max_T\sum_{e\in T}w(e)$}
A <spanning tree> with greatest total <edge weight>. Apply <Kruskal's algorithm> in decreasing weight order, or negate every <edge weight> and compute a <minimum spanning tree>. Every <graph path> within a <maximum spanning tree> solves the <widest path problem> between its endpoints.