1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
|
.Id SCCS-info %W% %E%
.Id $Id: vcgdemomaker.man,v 1.3 1995/01/05 19:52:26 sander Exp $
.TH VCGDEMOMAKER 1l 1995/01/05 "Release 1.3"
.SH NAME
vcgdemomaker \- produces demo specifications for
.I vcg
.SH SYNOPSIS
.B vcgdemomaker
outfile mode size
.SH DESCRIPTION
.I Vcgdemomaker
creates a
.I vcg
specification and writes it to
.I outfile.
The
.I mode
determines the kind of specification and
.I size
the size of the specified graph.
The specification can be read and visualized by the
.I VCG tool.
.SH MODI
.TP 1.0i
.B -unarytree
generates an unary tree, i.e. a linear sequence of nodes.
.I size
is the number of nodes - 1, i.e. the depth of the tree.
.TP
.B -binarytree
generates a binary tree of depth
.I size.
Each node has two successors.
.TP
.B -ternarytree
generates a ternary tree of depth
.I size.
Each node has 3 successors.
.TP
.B -leveltree
generates a leveled tree of depth
.I size.
Each node has 2 normal successors, and further a list of
nodes as successors at the same level to the left and right.
These lists contain at most 2 nodes, which itself are
leveled trees.
These trees are used to check the
.I nearedge
feature.
.TP
.B -twolevelcross
generates a cross graph.
This is a bipartitioned graph of connected parts of 4 nodes
forming a cross.
.I Size
is the number of nodes and should be even.
This graph is generated in an ugly format to check
the algorithm of reducing of crossing in the
.I VCG tool.
.TP
.B -allconnect
generates a graph where all pairs of node form an edge.
.I Size
is the number of nodes.
Note that if we have n nodes, we have about n*n/2 edges
which is a lot.
Thus it is recommended not to use this with more than 40 nodes.
.TP
.B -netgraph
generates a regular 4-ary network of triangular shape with about
.I size
nodes. This mesh graph can be used to check the capacity of the tool,
the view mechanism and
the algorithm of reducing of crossing in the
.I VCG tool.
.TP
.B -randomgraph
generates a randomized 4-ary network.
Starting from the regular 4-ary network of triangular shape with about
.I size
nodes, this network is produced by creating random holes.
Thus, this graph has less than
.I size
nodes.
.TP
.B -net2graph
generates a regular 4-ary network of rhomboid shape with about
.I size
nodes.
.TP
.B -random2graph
generates a randomized 4-ary network.
Starting from the regular 4-ary network of rhomboid shape with about
.I size
nodes, this network is produced by creating random holes.
Thus, this graph has less than
.I size
nodes.
.SH SEE ALSO
vcg(l)
.SH BUGS
Currently, no bugs are known.
.SH AUTHOR
Georg Sander, University of Saarland.
|
