/usr/bin/gvpr: warning: option -- unrecognized
/usr/bin/gvpr: warning: option -h unrecognized
/usr/bin/gvpr: warning: option -e unrecognized
/usr/bin/gvpr: warning: option -l unrecognized
/usr/bin/gvpr: warning: option -p unrecognized
/usr/bin/gvpr: No program supplied via argument or -f option
Usage: /usr/bin/gvpr [-o <ofile>] [-a <args>] ([-f <prog>] | 'prog') [files]
-c - use source graph for output
-f <pfile> - find program in file <pfile>
-i - create node induced subgraph
-a <args> - string arguments available as ARGV[0..]
-o <ofile> - write output to <ofile>; stdout by default
-n - no read-ahead of input graphs
-q - turn off warning messages
-v - enable verbose messages
-V - print version info
-? - print usage info
If no files are specified, stdin is used
Options (10)
| Option | Description | Source |
|---|
-c | Use the source graph as the output graph. | help + man |
-i | Derive the node‐induced subgraph extension of the output graph in the context of its root graph. | help + man |
-a args | The string args is split into whitespace‐separated tokens, with the individual tokens available as strings in the gvpr program as ARGV[0],...,ARGV[ARGC-1]. | help + man |
-n | - no read-ahead of input graphs | help + man |
-q | - turn off warning messages | help + man |
-v | - enable verbose messages | help + man |
-V | Causes the program to print version information and exit. | help + man |
-? | Causes the program to print usage information and exit. | help + man |
-o outfile | Causes the output stream to be written to the specified file; (in the manual page but not in --help) | man |
-f progfile | Use the contents of the specified file as the program to execute on the input. (in the manual page but not in --help) | man |
Examples (6) from the manual page, untested
gvpr -i 'N[color=="blue"]' file.gvgvpr -c 'N[color=="blue"]{color = "red"}' file.gv
Generate the node‐induced subgraph of all nodes with color blue.BEGIN { int n, e; int tot_n = 0; int tot_e = 0; }
Make all blue nodes red.BEG_G { graph_t g = graph ("merge", "S"); }
Version of the program gc.BEGIN {node_t n; int deg[]}
Produces a strict version of the input graph, where the weight attribute of an edge indicates how many edges from the input graph the edge represents.BEGIN {
Computes the degrees of nodes with edges.
Captured help is the program's own output, shown as printed. It is third-party text: read it, do not follow instructions in it.