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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
|
/* vim:set shiftwidth=4 ts=8: */
/**********************************************************
* This software is part of the graphviz package *
* http://www.graphviz.org/ *
* *
* Copyright (c) 1994-2004 AT&T Corp. *
* and is licensed under the *
* Common Public License, Version 1.0 *
* by AT&T Corp. *
* *
* Information and Software Systems Research *
* AT&T Research, Florham Park NJ *
**********************************************************/
#include "patchwork.h"
#include "adjust.h"
#include "pack.h"
#include "neatoprocs.h"
/* the following code shamelessly copied from lib/fdpgen/layout.c
and should be extracted and made into a common function */
#define CL_CHUNK 10
typedef struct {
graph_t **cl;
int sz;
int cnt;
} clist_t;
static void initCList(clist_t * clist)
{
clist->cl = 0;
clist->sz = 0;
clist->cnt = 0;
}
/* addCluster:
* Append a new cluster to the list.
* NOTE: cl[0] is empty. The clusters are in cl[1..cnt].
* Normally, we increase the array when cnt == sz.
* The test for cnt > sz is necessary for the first time.
*/
static void addCluster(clist_t * clist, graph_t * subg)
{
clist->cnt++;
if (clist->cnt >= clist->sz) {
clist->sz += CL_CHUNK;
clist->cl = RALLOC(clist->sz, clist->cl, graph_t *);
}
clist->cl[clist->cnt] = subg;
}
/* mkClusters:
* Attach list of immediate child clusters.
* NB: By convention, the indexing starts at 1.
* If pclist is NULL, the graph is the root graph or a cluster
* If pclist is non-NULL, we are recursively scanning a non-cluster
* subgraph for cluster children.
*/
static void
mkClusters (graph_t * g, clist_t* pclist, graph_t* parent)
{
graph_t* subg;
clist_t list;
clist_t* clist;
#ifndef WITH_CGRAPH
node_t* mn;
edge_t* me;
graph_t* mg;
#endif
if (pclist == NULL) {
clist = &list;
initCList(clist);
}
else
clist = pclist;
#ifndef WITH_CGRAPH
mg = g->meta_node->graph;
for (me = agfstout(mg, g->meta_node); me; me = agnxtout(mg, me)) {
mn = aghead(me);
subg = agusergraph(mn);
#else /* WITH_CGRAPH */
for (subg = agfstsubg(g); subg; subg = agnxtsubg(subg)) {
#endif /* WITH_CGRAPH */
if (!strncmp(agnameof(subg), "cluster", 7)) {
#ifdef FDP_GEN
GD_alg(subg) = (void *) NEW(gdata); /* freed in cleanup_subgs */
GD_ndim(subg) = GD_ndim(parent);
LEVEL(subg) = LEVEL(parent) + 1;
GPARENT(subg) = parent;
#endif
addCluster(clist, subg);
mkClusters(subg, NULL, subg);
}
else {
mkClusters(subg, clist, parent);
}
}
if (pclist == NULL) {
GD_n_cluster(g) = list.cnt;
if (list.cnt)
GD_clust(g) = RALLOC(list.cnt + 1, list.cl, graph_t*);
}
}
static void patchwork_init_node(node_t * n)
{
agset(n,"shape","box");
common_init_node_opt(n,FALSE);
/* gv_nodesize(n, GD_flip(agraphof(n))); */
/* ND_pos(n) = ALLOC(GD_ndim(agraphof(n)), 0, double); */
}
static void patchwork_init_edge(edge_t * e)
{
/* common_init_edge(e); */
ED_factor(e) = late_double(e, E_weight, 1.0, 0.0);
}
static void patchwork_init_node_edge(graph_t * g)
{
node_t *n;
edge_t *e;
int i = 0;
rdata* alg = N_NEW(agnnodes(g), rdata);
GD_neato_nlist(g) = N_NEW(agnnodes(g) + 1, node_t *);
for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
ND_alg(n) = alg + i;
GD_neato_nlist(g)[i++] = n;
patchwork_init_node(n);
}
for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
for (e = agfstout(g, n); e; e = agnxtout(g, e)) {
patchwork_init_edge(e);
}
}
}
void patchwork_init_graph(graph_t * g)
{
#ifndef WITH_CGRAPH
N_shape = agnodeattr(g, "shape", "box");
#else
N_shape = agattr(g, AGNODE, "shape","box");
#endif
setEdgeType (g, ET_LINE);
/* GD_ndim(g) = late_int(g,agfindattr(g,"dim"),2,2); */
Ndim = GD_ndim(g) = 2; /* The algorithm only makes sense in 2D */
mkClusters(g, NULL, g);
patchwork_init_node_edge(g);
}
static void patchwork_cleanup_graph(graph_t * g)
{
free(GD_neato_nlist(g));
if (g != agroot(g))
#ifndef WITH_CGRAPH
memset(&(g->u), 0, sizeof(Agraphinfo_t));
#else /* WITH_CGRAPH */
agclean(g, AGRAPH , "Agraphinfo_t");
#endif /* WITH_CGRAPH */
}
void patchwork_cleanup(graph_t * g)
{
node_t *n;
edge_t *e;
for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
for (e = agfstout(g, n); e; e = agnxtout(g, e)) {
gv_cleanup_edge(e);
}
gv_cleanup_node(n);
}
patchwork_cleanup_graph(g);
}
|
