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
|
/* $Id: circular.h,v 1.1.1.1 2004/12/23 04:04:30 ellson Exp $ $Revision: 1.1.1.1 $ */
/* 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 *
**********************************************************/
#ifndef CIRCULAR_H
#define CIRCULAR_H
#include <render.h>
#include <block.h>
#include <stack.h>
typedef struct {
blocklist_t bl;
int orderCount;
int blockCount;
nstack_t *bcstack;
attrsym_t *N_artpos;
attrsym_t *N_root;
char *rootname;
double min_dist;
} circ_state;
typedef struct {
Agnode_t *dnode;
} ndata;
/* Extra node data used for layout:
* Pass O: build derived graph
* Pass 1: construct blocks
* Pass 2: construct block tree
* Pass 3: layout block
* a: construct block skeleton
* b: construct skeleton spanning tree
* c: construct circular list of nodes
* Pass 4: connect blocks
*/
typedef struct {
union { /* Pointer to node/cluster in original graph */
Agraph_t *g;
Agnode_t *np;
} orig;
int flags;
node_t *parent; /* parent in block-cutpoint traversal (1,2,4) */
block_t *block; /* Block containing node (1,2,3,4) */
union {
struct { /* Pass 1 */
node_t *next; /* used for stack */
int val;
int low_val;
} bc;
node_t *clone; /* Cloned node (3a) */
struct { /* Spanning tree and longest path (3b) */
node_t *tparent; /* Parent in tree */
node_t *first; /* Leaf on longest path from node */
node_t *second; /* Leaf on 2nd longest path from node */
int fdist; /* Length of longest path from node */
int sdist; /* Length of 2nd longest path from node */
} t;
struct {
int pos; /* Index of node in block circle (3c,4) */
double psi; /* Offset angle of children (4) */
} f;
} u;
} cdata;
typedef struct {
int order;
} edata;
#define NDATA(n) ((ndata*)((n)->u.alg))
#define DNODE(n) (NDATA(n)->dnode)
#define EDGEDATA(e) ((edata*)((e)->u.alg))
#define EDGEORDER(e) (EDGEDATA(e)->order)
#define DATA(n) ((cdata*)((n)->u.alg))
#define ORIGG(n) (DATA(n)->orig.g)
#define ORIGN(n) (DATA(n)->orig.np)
#define FLAGS(n) (DATA(n)->flags)
#define PARENT(n) (DATA(n)->parent)
#define BLOCK(n) (DATA(n)->block)
#define NEXT(n) (DATA(n)->u.bc.next)
#define VAL(n) (DATA(n)->u.bc.val)
#define LOWVAL(n) (DATA(n)->u.bc.low_val)
#define CLONE(n) (DATA(n)->u.clone)
#define TPARENT(n) (DATA(n)->u.t.tparent)
#define LEAFONE(n) (DATA(n)->u.t.first)
#define LEAFTWO(n) (DATA(n)->u.t.second)
#define DISTONE(n) (DATA(n)->u.t.fdist)
#define DISTTWO(n) (DATA(n)->u.t.sdist)
#define POSITION(n) (DATA(n)->u.f.pos)
#define PSI(n) (DATA(n)->u.f.psi)
#define VISITED_F (1 << 0)
#define BCDONE_F (1 << 1)
#define ONSTACK_F (1 << 2)
#define PARENT_F (1 << 3)
#define PATH_F (1 << 4)
#define NEIGHBOR_F (1 << 5)
#define VISITED(n) (FLAGS(n)&VISITED_F)
#define BCDONE(n) (FLAGS(n)&BCDONE_F)
#define ONSTACK(n) (FLAGS(n)&ONSTACK_F)
#define ISPARENT(n) (FLAGS(n)&PARENT_F)
#define ONPATH(n) (FLAGS(n)&PATH_F)
#define NEIGHBOR(n) (FLAGS(n)&NEIGHBOR_F)
#define SET_VISITED(n) (FLAGS(n) |= VISITED_F)
#define SET_BCDONE(n) (FLAGS(n) |= BCDONE_F)
#define SET_ONSTACK(n) (FLAGS(n) |= ONSTACK_F)
#define SET_PARENT(n) (FLAGS(n) |= PARENT_F)
#define SET_ONPATH(n) (FLAGS(n) |= PATH_F)
#define SET_NEIGHBOR(n) (FLAGS(n) |= NEIGHBOR_F)
#define UNSET_VISITED(n) (FLAGS(n) &= ~VISITED_F)
#define UNSET_BCDONE(n) (FLAGS(n) &= ~BCDONE_F)
#define UNSET_ONSTACK(n) (FLAGS(n) &= ~ONSTACK_F)
#define UNSET_NEIGHBOR(n) (FLAGS(n) &= ~NEIGHBOR_F)
#define DEGREE(n) (ND_order(n))
#include <circo.h>
#ifdef __cplusplus
extern "C" {
#endif
#ifdef DEBUG
extern void prData(Agnode_t * n, int pass);
#endif
extern void circularLayout(Agraph_t * sg);
#ifdef __cplusplus
}
#endif
#endif
|
