complement package:algebraic-graphs

The edge complement of a graph. Note that, as can be seen from the examples below, this operation ignores self-loops. Complexity: O(n^2 * log n) time, O(n^2) memory.

complement empty           == empty
complement (vertex x)      == (vertex x)
complement (edge 1 2)      == (vertices [1, 2])
complement (edge 0 0)      == (edge 0 0)
complement (star 1 [2, 3]) == (overlay (vertex 1) (edge 2 3))
complement . complement    == id