csdp-graphtoprob - Man Page

Convert a graph description to SDPA sparse format


csdp-graphtoprob GRAPH_FILE PROBLEM_FILE


The csdp-graphtoprob program converts a graph into SDPA sparse format.

File Format

The input file should be in the following format:

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 same graph written to it in SDPA sparse format.

Exit Status

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


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

csdp-theta(1), csdp-complement(1), csdp-rand_graph(1)

Referenced By

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

6.1.1 Brian Borchers