# csdp-complement man page

csdp-complement — Compute the complement of a graph

## Synopsis

**csdp-complement** GRAPH_FILE OUTPUT_FILE

## Description

The csdp-complement program computes the complement of a graph.

## File Format

The input file should be in the following format:

n

m

i1 j1

…

im jm

where n is the number of nodes, m is the number of edges, and each i/j pair describes one edge.

The output file has the the complement of the graph written to it in the same format.

## Exit Status

The exit status is zero if the complement is computed successfully. Otherwise, the exit status is one, and an error message indicating the problem is produced on standard out.

## Authors

Csdp was written by Dr. Brian Borchers <borchers@nmt.edu>, with contributions by Joseph Young <josyoun@nmt.edu> and Aaron Wilson <wilson@nmt.edu>.

This man page was written by Jerry James <loganjerry@gmail.com>. It is distributed under the same terms as Csdp.

## See Also

## Referenced By

csdp-graphtoprob(1), csdp-rand_graph(1), csdp-theta(1).