Algorithms for Crossing Numbers

[MarkToner]

Added functionality for computing the crossing number of digraphs, both actual values and upper and lower bounds.

Also added miscellaneous functionality to support this goal:

• Generation of cubic and semicomplete digraphs
• Checking if a digraph is cubic or semicomplete
• Adding of an artificial vertex between two given edges
• Computing of all three cycles and triangles in a digraph
• Computing the size of the partitions of a complete multipartite digraph (I feel this was probably achievable before but I could not find the documentation for such a method).

All functionality has been tested, with all public-facing functionality documented.

[james-d-mitchell]

@MarkToner looks like there's lots of good stuff in this PR, can you please fix the linting issues, and then we will give this a proper review? Thanks!

[MarkToner]

@james-d-mitchell Will do as soon as soon as possible!

[mtorpey]

I can see a few changes that you must have committed by accident, which seem to be preventing tests from passing. Take a look at the lines I've commented on, and probably just revert them. That might get the last tests passing.

[mtorpey]

I've merged this into my own crossing-numbers branch, and I'll see if we can review it bit by bit like we did with the edge weightings stuff. I'll start with some of the minor methods. :)

[james-d-mitchell]

Good idea! Thanks @mtorpey