Convert traced wiring diagrams to morphism expressions

The machinery for converting wiring diagrams to morphism expressions should support traced monoidal categories.

This is not a purely mechanical job; some thinking will be needed. At the very least, self-loops must be detected. Also, some parts of the existing algorithm use a topological sort and so assume that the underlying graph is a DAG. This assumption must be relaxed.