| 1 | /* $Id$Revision: */ |
| 2 | /* vim:set shiftwidth=4 ts=8: */ |
| 3 | |
| 4 | /************************************************************************* |
| 5 | * Copyright (c) 2011 AT&T Intellectual Property |
| 6 | * All rights reserved. This program and the accompanying materials |
| 7 | * are made available under the terms of the Eclipse Public License v1.0 |
| 8 | * which accompanies this distribution, and is available at |
| 9 | * http://www.eclipse.org/legal/epl-v10.html |
| 10 | * |
| 11 | * Contributors: See CVS logs. Details at http://www.graphviz.org/ |
| 12 | *************************************************************************/ |
| 13 | |
| 14 | #ifndef ASPECT_H |
| 15 | #define ASPECT_H |
| 16 | |
| 17 | typedef struct aspect_t { |
| 18 | double targetAR; /* target aspect ratio */ |
| 19 | double combiAR; |
| 20 | int prevIterations; /* no. of iterations in previous pass */ |
| 21 | int curIterations; /* no. of iterations in current pass */ |
| 22 | int nextIter; /* dynamically adjusted no. of iterations */ |
| 23 | int nPasses; /* bound on no. of top-level passes */ |
| 24 | int badGraph; /* hack: set if graph is disconnected or has |
| 25 | * clusters. If so, turn off aspect */ |
| 26 | } aspect_t; |
| 27 | |
| 28 | extern aspect_t* setAspect (Agraph_t * g, aspect_t* adata); |
| 29 | extern void rank3(graph_t * g, aspect_t * asp); |
| 30 | extern void initEdgeTypes(graph_t * g); |
| 31 | extern void init_UF_size(graph_t * g); |
| 32 | extern int countDummyNodes(graph_t * g); |
| 33 | |
| 34 | #endif /* ASPECT_H */ |
| 35 | |
| 36 | |