Visit Our UNIX and Linux User Community

Linux and UNIX Man Pages

Test Your Knowledge in Computers #821
Difficulty: Easy
HTML5 is a software solution stack that defines the properties and behaviors of web page content by implementing a markup based pattern to it.
True or False?
Linux & Unix Commands - Search Man Pages

gv2gml(1) [centos man page]

GML2GV,GV2GML(1)					      General Commands Manual						  GML2GV,GV2GML(1)

NAME
gml2gv,gv2gml - GML-DOT converters SYNOPSIS
gml2gv [ -?v ] [ -ggname ] [ -ooutfile ] [ files ] gv2gml [ -? ] [ -ooutfile ] [ files ] DESCRIPTION
gml2gv converts a graph specified in the GML format to a graph in the GV (formerly DOT) format. gv2gml converts a graph specified in the GV format to a graph in the GML format. OPTIONS
The following options are supported: -v Turns on verbose mode -? Prints usage information and exits. -ggname The string gname is used as the name of the generated graph. If multiple graphs are generated, subsequent graphs use the name gname appended with an integer. -ooutfile Prints output to the file outfile. If not given, gml2gv uses stdout. OPERANDS The following operand is supported: files Names of files containing 1 or more graphs in GML. If no files operand is specified, the standard input will be used. RETURN CODES
Return 0 if there were no problems during conversion; and non-zero if any error occurred. LIMITATIONS
As both the graph and graphics models of GV and GML differ significantly, the conversion is at best approximate. In particular, it is not clear how multiedges are differentiated in GML, so multiedges are created in GV with no user-available key. Also, no attribute information is lost, in that any GML attributes that aren't converted to GV equivalents are retained as attributes in the output graph. At present, gv2gml does not support subgraphs and clusters. In addition, there does not appear to be a standard mechanism for specifying default node and edge attributes in GML, so any attributes are repeated for every node and edge. AUTHORS
Emden R. Gansner <erg@research.att.com> SEE ALSO
dot(1), libcgraph(3) 24 June 2011 GML2GV,GV2GML(1)

Check Out this Related Man Page

BCOMPS(1)						      General Commands Manual							 BCOMPS(1)

NAME
bcomps - biconnected components filter for graphs SYNOPSIS
bcomps [ -stvx? ] [ -ooutfile ] [ files ] DESCRIPTION
bcomps decomposes graphs into their biconnected components, printing the components to standard output. OPTIONS
The following options are supported: -s No output graph is printed. Implies the -v flag. -t Print the underlying block-cutvertex tree. -x Each biconnected component is printed as a separate root graph. -v Prints number of blocks and cutvertices. -o outfile If specified, each root graph will be written to a different file with the names derived from outfile. In particular, if both -o and -x flags are used, then each block is written to a different file. If outfile does not have a suffix, the nth block of the ith graph is written to outfile_n_i. However, the 0th block of the 0th graph is written to outfile. If outfile has a suffix, i.e., has the form base.sfx, then the files will have the same name as above, except appended with .sfx. The block-cutvertex tree of ith graph is written to outfile_n_T, with an appended suffix if specified. By default, each input graph is printed, with each block given as a subgraph whose name is a concatenation of the name of the input graph, the string "_bcc_" and the number of the block. OPERANDS
The following operand is supported: files Names of files containing 1 or more graphs in dot format. If no files operand is specified, the standard input will be used. RETURN CODES
bcomps returns 0 if all the input graphs are biconnected; and non-zero if any graph has multiple blocks, or any error occurred. BUGS
It is possible, though unlikely, that the names used for connected components and their subgraphs may conflict with existing subgraph names. AUTHORS
Emden R. Gansner <erg@research.att.com> SEE ALSO
ccomps(1), gc(1), dot(1), gvpr(1), gvcolor(1), acyclic(1), sccmap(1), tred(1), libgraph(3) 18 November 2003 BCOMPS(1)

Featured Tech Videos