Light edge crossing a cut (source code)

= Light edge crossing a cut

An <edge> of minimum <edge weight> among those crossing a specified <cut of a graph>. It exists when the crossing set is nonempty. Several tied edges can all be light; lightness does not imply uniqueness or membership in every <minimum spanning tree>.