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. A demonstration module called girth computes the shortest circuit and the diameter of Ramanujan graphs. 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. One such family of graphs is equivalent to a simple RISC chip, a programmable microcomputer with a variable number of registers.
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. For further information see The Stanford GraphBase, published by ACM Press in 1993. Indeed, the author firmly believes that the best serious work is also good fun. We needn't apologize if we enjoy doing research.