debian man page for bliss

BLISS(1)							bliss version 0.50							  BLISS(1)

NAME
       bliss - Compute automorphism groups and canonical labelings of graphs

SYNOPSIS
       bliss [options] [<graph file>]

DESCRIPTION
       Tool for computing automorphism groups and canonical labelings of graphs

       -directed
	   the input graph is directed

       -can
	   compute canonical form

       -ocan=f
	   compute canonical form and output it in file f

       -v=N
	   set verbose level to N; N >= 0 and 1 by default

       -sh=x
	   select splitting heuristics, where x is

	   f
	       first non-singleton cell

	   fl
	       first largest non-singleton cell

	   fs
	       first smallest non-singleton cell

	   fm
	       first maximally non-trivially connected non-singleton cell [default]

	   flm
	       first largest maximally non-trivially connected non-singleton cell

	   fsm
	       first smallest maximally non-trivially connected non-singleton cell

       -version
	   print the version number and exit

       -help
	   print help and exit

May 2009							    11/06/2012								  BLISS(1)