Cuts in a graph
						B
		A
	Link Cut • set of links whose removal makes a graph disconnected • cost of a cut:
	Find minimum cut • gives you a segmentation • fast algorithms exist for doing this