The overall graph is, however, connected. No good algorithm is known for finding the optimum solution to problems like this, so the data provides an opportunity for researchers to exhibit better and better solutions with better and better techniques as algorithmic progress is made. Greed appears to be victorious, at least in the economic sphere. Four algorithms for minimum spanning trees are implemented and compared, including some that are theoretically appealing but do not seem to fare so well in practice. It is interesting and important to test algorithms on both kinds of graphs, in order to see if there is any significant difference in performance.
Pixel data can lead to interesting bipartite graphs.
Although the assignment problem being solved here has no relevance to art criticism or art appreciation, it does have great pedagogical value, because there is probably no better way to understand the characteristics of a large array of numbers than to perceive the array as an image. Indeed, the author firmly believes that the best serious work is also good fun. Es ist schwer nicht durchzudreh'n.