distgraphg - Man Page

distgraphg [-e|o|i] [-d#|-d#:#]... [-q] [infile [outfile]]

Form graphs defined by distances in the input graphs. The -d,-e,-o-i

parameters define a set of distances. The output graph has an edge if the distance in the input graph is in the set.

-d# -d#:# Specify a range of allowed distances.

Can be repeated up to 100 times.

-i Include infinity (unreachable vertices)

-e,  -o

Only allow even or odd distances

If none of -d,-e,-o,-i is present, the square of the graph is taken. If -e or -o appear without -d, all even or all odd distances are allowed.

The output file has a header if and only if the input file does.

-q

Suppress auxiliary information.