Login or Register to Ask a Question and Join Our Community

Linux and UNIX Man Pages

Linux & Unix Commands - Search Man Pages

cliquer(1) [debian man page]

CLIQUER(1)							      CLIQUER								CLIQUER(1)

NAME

       cliquer - find cliques in weighted and unweighted graphs.

SYNOPSIS

       cliquer --help

       cliquer [ options ] graph-filename

DESCRIPTION

       cliquer searched for cliques in a graph.  The graph is read from the file given as command line argument, or stdin if that filename is "-".

       The file must be ASCII as described below or a binary DIMACS-format.

       By default it prints the first maximal clique it finds, but this can be changed with the options described below.

OPTIONS

       -h --help
	      Displays a short list of options and what they do.

       -a --all
	      Find all cliques.

       -s --single
	      Find only one clique (default).

       -w --weight
	      Tell only maximum weight (no faster than -s).

       -m N --min N
	      Search for cliques with weight at least N.

	      If N=0, searches for maximum weight clique (default).

       -M N --max N
	      Search for cliques with weight at most N.

	      If N=0, no limit is imposed (default).

	      N being positive is incompatible with "--min 0" ("--min 1" is assumed).

       -x --maximal
	      Require cliques to be maximal.

       -u --unweighted
	      Assume weight 1 for all vertices.

       -0 --from-0
	      Number vertices 0 to n-1 instead of 1 to n when writing.

       -q --quiet
	      Suppresses progress output.

	      Specifying -q twice suppresses all output except the actual result.

       -r F --reorder F
	      Reorder with function F.	Available reordering functions are:

	      none   No ordering (same order as in the file).

	      reverse
		     Reverse order as in the file.

	      default
		     One of the two below, depending on weightedness.

	      unweighted-coloring
		     Coloring method efficient for unweighted graphs.

	      weighted-coloring
		     Coloring method efficient for weighted graphs.

	      degree Order by ascending degree.

	      random Random order.

FILE FORMAT

       The format of the ASCII representation of a graph is the following: Each line has a single letter (enclosed in spaces) as first part.

       A  line	with 'p' starts the graph.  The second token is a name of at most 15 characters and ignored.  Then there is the number of nodes in
       this graph.  Then the number of edges (currently ignored).

       A line with 'e' adds an edge.  The two next tokens are the numbers of two nodes to connect.

       A line with 'n' weights an node.  The first argument is the number of the node to assign a weight to, the second it's weight.

EXAMPLE

	p clausehouse 5 8
	e 4 3
	e 3 1
	e 1 2
	e 2 3
	e 3 5
	e 5 2
	e 2 4
	e 4 5
	n 1 2

COPYRIGHT

       Cliquer is Copyright (C) 2002 Sampo Niskanen, Patric Ostergard

       Cliquer is licensed under the GNU General Public License as published by the Free Software Foundation; either version 2 of the License,	or
       (at your option) any later version. The full license is included in the file LICENSE.

       Basically, you can use Cliquer for any purpose, provided that any programs or modifications you make and distribute are also licensed under
       the GNU GPL.

       ABSOLUTELY NO GUARANTEES OR WARRANTIES are made concerning the suitability, correctness, or any other aspect of these routines.

       This manpage is based on text from the cliquer program with the obove copyright and license with modification Copyright (C) 2011   Bernhard
       R. Link, also available under above license.

cliquer 							    2011-03-14								CLIQUER(1)

Check Out this Related Man Page

GC(1)							      General Commands Manual							     GC(1)

NAME

       gvgen - generate graphs

SYNOPSIS

       gvgen  [  -d?   ] [ -cn ] [ -Cx,y ] [ -g[f]x,y ] [ -G[f]x,y ] [ -hn ] [ -kn ] [ -bx,y ] [ -pn ] [ -sn ] [ -Sn ] [ -tn ] [ -Tx,y ] [ -wn ] [
       -ooutfile ]

DESCRIPTION

       gvgen generates a variety of simple, regularly-structured abstract graphs.

OPTIONS

       The following options are supported:

       -c n   Generate a cycle with n vertices and edges.

       -C x,y Generate an x by y cylinder.  This will have x*y vertices and 2*x*y - y edges.

       -g [f]x,y
	      Generate an x by y grid.	If f is given, the grid is folded, with an edge attaching each pair of	opposing  corner  vertices.   This
	      will have x*y vertices and 2*x*y - y - x edges if unfolded and 2*x*y - y - x + 2 edges if folded.

       -G [f]x,y
	      Generate	an  x by y partial grid.  If f is given, the grid is folded, with an edge attaching each pair of opposing corner vertices.
	      This will have x*y vertices.

       -h n   Generate a hypercube of degree n.  This will have 2^n vertices and n*2^(n-1) edges.

       -k n   Generate a complete graph on n vertices with n*(n-1)/2 edges.

       -b x,y Generate a complete x by y bipartite graph.  This will have x+y vertices and x*y edges.

       -p n   Generate a path on n vertices.  This will have n-1 edges.

       -s n   Generate a star on n vertices.  This will have n-1 edges.

       -S n   Generate a Sierpinski graph of order n.  This will have 3*(3^(n-1) - 1)/2 vertices and 3^n edges.

       -t n   Generate a binary tree of height n.  This will have 2^n-1 vertices and 2^n-2 edges.

       -T x,y Generate an x by y torus.  This will have x*y vertices and 2*x*y edges.

       -w n   Generate a path on n vertices.  This will have n-1 edges.

       -o outfile
	      If specified, the generated graph is written into the file outfile.  Otherwise, the graph is written to standard out.

       -d     Make the generated graph directed.

       -?     Print usage information.

EXIT STATUS

       gvgen exits with 0 on successful completion, and exits with 1 if given an ill-formed or incorrect flag, or if  the  specified  output  file
       could not be opened.

AUTHOR

       Emden R. Gansner <erg@research.att.com>

SEE ALSO

       gc(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), tred(1), libgraph(3)

								   27 March 2008							     GC(1)
Man Page