deledgeg [-lq] [-v#] [-d#] [-z] [infile [outfile]]
For each edge e, output G-e
The output file has a header if and only if the input file does.
Consider as digraph and delete directed edges
Canonically label outputs
-v# Only delete edges incident to this vertex (as head for digraph)
-d# Specify a lower bound on the minimum out-degree of the output
Suppress auxiliary information