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
|
/* $Id: block.h,v 1.4 2009/08/10 20:14:23 erg Exp $ $Revision: 1.4 $ */
/* 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 *
**********************************************************/
#ifdef __cplusplus
extern "C" {
#endif
#ifndef BLOCK_H
#define BLOCK_H
#include <nodelist.h>
typedef struct block block_t;
typedef struct {
block_t *first;
block_t *last;
} blocklist_t;
struct block {
Agnode_t *child; /* if non-null, points to node in parent block */
block_t *next; /* sibling block */
Agraph_t *sub_graph; /* nodes and edges in this block */
double radius; /* radius of block and subblocks */
double rad0; /* radius of block */
nodelist_t *circle_list; /* ordered list of nodes in block */
blocklist_t children; /* child blocks */
double parent_pos; /* if block has 1 node, angle to place parent */
int flags;
};
extern block_t *mkBlock(Agraph_t *);
extern void freeBlock(block_t * sp);
extern int blockSize(block_t * sp);
extern void initBlocklist(blocklist_t *);
extern void appendBlock(blocklist_t * sp, block_t * sn);
extern void insertBlock(blocklist_t * sp, block_t * sn);
/* extern void freeBlocklist (blocklist_t* sp); */
#ifdef DEBUG
extern void printBlocklist(blocklist_t * snl);
#endif
#define CHILD(b) ((b)->child)
#define BLK_PARENT(b) (CHILD(b)? PARENT(CHILD(b)) : 0)
#define BLK_FLAGS(b) ((b)->flags)
#define COALESCED_F (1 << 0)
#define COALESCED(b) (BLK_FLAGS(b)&COALESCED_F)
#define SET_COALESCED(b) (BLK_FLAGS(b) |= COALESCED_F)
#endif
#ifdef __cplusplus
}
#endif
|