Turn on the use of cgraph for gvpr.

As a side-effect, this uses the new vertex model, so additional functions
are now available.

diff --git a/cmd/gvpr/gvpr.1 b/cmd/gvpr/gvpr.1
index 79a1bf597a60d6c7d36b1c1b515ba716411fc4a8..ba51c224a874f9acdd56ca6cc70f15292c1aec48 100644 (file)
--- a/cmd/gvpr/gvpr.1
+++ b/cmd/gvpr/gvpr.1
@@ -353,7 +353,6 @@ returns the next node after \fIn\fP in the root graph, or \fBNULL\fP.
 .TP
 \fBnxtnode_sg\fP(\fIsg\fP : \fBgraph_t\fP, \fIn\fP : \fBnode_t\fP) : \fBnode_t\fP
 returns the next node after \fIn\fP in \fIsg\fP, or \fBNULL\fP.
-(\fBCurrently unsupported\fP)
 .TP
 \fBisNode\fP(\fIsg\fP : \fBgraph_t\fP, \fIs\fP : \fBstring\fP) : \fBnode_t\fP
 looks for a node in (sub)graph \fIsg\fP of name \fIs\fP. If such a node
@@ -362,19 +361,15 @@ exists, it is returned. Otherwise, \fBNULL\fP is returned.
 \fBisSubnode\fP(\fIsg\fP : \fBgraph_t\fP, \fIn\fP : \fBnode_t\fP) : \fBint\fP
 returns non-zero if node \fIn\fP is in (sub)graph \fIsg\fP, or zero
 otherwise.
-(\fBCurrently unsupported\fP)
 .TP
 \fBindegreeOf\fP(\fIsg\fP : \fBgraph_t\fP, \fIn\fP : \fBnode_t\fP) : \fBint\fP
 returns the indegree of node \fIn\fP in (sub)graph \fIsg\fP.
-(\fBCurrently unsupported\fP)
 .TP
 \fBoutdegreeOf\fP(\fIsg\fP : \fBgraph_t\fP, \fIn\fP : \fBnode_t\fP) : \fBint\fP
 returns the outdegree of node \fIn\fP in (sub)graph \fIsg\fP.
-(\fBCurrently unsupported\fP)
 .TP
 \fBdegreeOf\fP(\fIsg\fP : \fBgraph_t\fP, \fIn\fP : \fBnode_t\fP) : \fBint\fP
 returns the degree of node \fIn\fP in (sub)graph \fIsg\fP.
-(\fBCurrently unsupported\fP)
 .SS "Edges"
 .TP
 \fBedge\fP(\fIt\fP : \fBnode_t\fP, \fIh\fP : \fBnode_t\fP, \fIs\fP : \fBstring\fP) : \fBedge_t\fP
@@ -388,7 +383,6 @@ creates an edge with tail node \fIt\fP, head node \fIh\fP and name \fIs\fP
 in (sub)graph \fIsg\fP (and all parent graphs). If the graph is undirected, the distinction between
 head and tail nodes is unimportant.
 If such an edge already exists, it is returned.
-(\fBCurrently unsupported\fP)
 .TP
 \fBsubedge\fP(\fIg\fP : \fBgraph_t\fP, \fIe\fP : \fBedge_t\fP) : \fBedge_t\fP
 inserts the edge \fIe\fP into the subgraph \fIg\fP. Returns the edge.
@@ -404,54 +398,46 @@ looks for an edge with tail node \fIt\fP, head node \fIh\fP and
 name \fIs\fP in (sub)graph \fIsg\fP. If the graph is undirected, the distinction between
 head and tail nodes is unimportant.
 If such an edge exists, it is returned. Otherwise, \fBNULL\fP is returned.
-(\fBCurrently unsupported\fP)
 .TP
 \fBisSubedge\fP(\fIg\fP : \fBgraph_t\fP, \fIe\fP : \fBedge_t\fP) : \fBint\fP
 returns non-zero if edge \fIe\fP is in (sub)graph \fIsg\fP, or zero
 otherwise.
-(\fBCurrently unsupported\fP)
 .TP
 \fBfstout\fP(\fIn\fP : \fBnode_t\fP) : \fBedge_t\fP
 returns the first outedge of node \fIn\fP in the root graph.
 .TP
 \fBfstout_sg\fP(\fIsg\fP : \fBgraph_t\fP, \fIn\fP : \fBnode_t\fP) : \fBedge_t\fP
 returns the first outedge of node \fIn\fP in (sub)graph \fIsg\fP.
-(\fBCurrently unsupported\fP)
 .TP
 \fBnxtout\fP(\fIe\fP : \fBedge_t\fP) : \fBedge_t\fP
 returns the next outedge after \fIe\fP in the root graph.
 .TP
 \fBnxtout_sg\fP(\fIsg\fP : \fBgraph_t\fP, \fIe\fP : \fBedge_t\fP) : \fBedge_t\fP
 returns the next outedge after \fIe\fP in graph \fIsg\fP.
-(\fBCurrently unsupported\fP)
 .TP
 \fBfstin\fP(\fIn\fP : \fBnode_t\fP) : \fBedge_t\fP
 returns the first inedge of node \fIn\fP in the root graph.
 .TP
 \fBfstin_sg\fP(\fIsg\fP : \fBgraph_t\fP, \fIn\fP : \fBnode_t\fP) : \fBedge_t\fP
 returns the first inedge of node \fIn\fP in graph \fIsg\fP.
-(\fBCurrently unsupported\fP)
 .TP
 \fBnxtin\fP(\fIe\fP : \fBedge_t\fP) : \fBedge_t\fP
 returns the next inedge after \fIe\fP in the root graph.
 .TP
 \fBnxtin_sg\fP(\fIsg\fP : \fBgraph_t\fP, \fIe\fP : \fBedge_t\fP) : \fBedge_t\fP
 returns the next inedge after \fIe\fP in graph \fIsg\fP.
-(\fBCurrently unsupported\fP)
 .TP
 \fBfstedge\fP(\fIn\fP : \fBnode_t\fP) : \fBedge_t\fP
 returns the first edge of node \fIn\fP in the root graph.
 .TP
 \fBfstedge_sg\fP(\fIsg\fP : \fBgraph_t\fP, \fIn\fP : \fBnode_t\fP) : \fBedge_t\fP
 returns the first edge of node \fIn\fP in graph \fIsg\fP.
-(\fBCurrently unsupported\fP)
 .TP
 \fBnxtedge\fP(\fIe\fP : \fBedge_t\fP, \fBnode_t\fP) : \fBedge_t\fP
 returns the next edge after \fIe\fP in the root graph.
 .TP
 \fBnxtedge_sg\fP(\fIsg\fP : \fBgraph_t\fP, \fIe\fP : \fBedge_t\fP, \fBnode_t\fP) : \fBedge_t\fP
 returns the next edge after \fIe\fP in the graph \fIsg\fP.
-(\fBCurrently unsupported\fP)
 .SS "Graph I/O"
 .TP
 \fBwrite\fP(\fIg\fP : \fBgraph_t\fP) : \fBvoid\fP