"An edge is light edge crossing the cut if its weight is minimum of any edge crossing the cut"
So lets say you have a graph G = (V, E), and you partition the vertices in V into to sets A and B= V-A (neither A or B are empty sets). Then the light edges (u, v) in E where either u or v is in A and the other is in B, and where none of the other edges in E that fill this criteria have a shorter weight.
Chat with our AI personalities
The x-axis
writing about earth
it is a independent coordinate sometimes called x, also known as abscissa, often laid out horizontally
"Curved" refers to something that deviates from a straight line. It may refer to a bend in the road, a line on a graph, or the trajectory of a baseball.
A scatter plot is also known as a scatter diagram. It is a graph in which the values of two variables are plotted along two axes.