Graphviz  2.41.20170921.2350
dotprocs.h
Go to the documentation of this file.
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 DOTPROCS_H
15 #define DOTPROCS_H
16 
17 #ifdef __cplusplus
18 extern "C" {
19 #endif
20 
21 #include "aspect.h"
22 
23  extern void acyclic(Agraph_t *);
24  extern void allocate_ranks(Agraph_t *);
25  extern void build_ranks(Agraph_t *, int);
26  extern void build_skeleton(Agraph_t *, Agraph_t *);
27  extern void checkLabelOrder (graph_t* g);
28  extern void class1(Agraph_t *);
29  extern void class2(Agraph_t *);
30  extern void decompose(Agraph_t *, int);
31  extern void delete_fast_edge(Agedge_t *);
32  extern void delete_fast_node(Agraph_t *, Agnode_t *);
33  extern void delete_flat_edge(Agedge_t *);
34  extern void dot_cleanup(graph_t * g);
35  extern void dot_layout(Agraph_t * g);
36  extern void dot_init_node_edge(graph_t * g);
37  extern void dot_scan_ranks(graph_t * g);
38  extern void enqueue_neighbors(nodequeue * q, node_t * n0, int pass);
39  extern void expand_cluster(Agraph_t *);
40  extern Agedge_t *fast_edge(Agedge_t *);
41  extern void fast_node(Agraph_t *, Agnode_t *);
42  extern void fast_nodeapp(Agnode_t *, Agnode_t *);
45  extern void flat_edge(Agraph_t *, Agedge_t *);
46  extern int flat_edges(Agraph_t *);
47  extern void install_cluster(Agraph_t *, Agnode_t *, int, nodequeue *);
48  extern void install_in_rank(Agraph_t *, Agnode_t *);
49  extern int is_cluster(Agraph_t *);
50  extern void dot_compoundEdges(Agraph_t *);
51  extern Agedge_t *make_aux_edge(Agnode_t *, Agnode_t *, double, int);
52  extern void mark_clusters(Agraph_t *);
53  extern void mark_lowclusters(Agraph_t *);
54  extern int mergeable(edge_t * e, edge_t * f);
55  extern void merge_chain(Agraph_t *, Agedge_t *, Agedge_t *, int);
56  extern void merge_oneway(Agedge_t *, Agedge_t *);
57  extern int ncross(Agraph_t *);
59  extern int nonconstraint_edge(Agedge_t *);
60  extern void other_edge(Agedge_t *);
61  extern void rank1(graph_t * g);
62  extern int portcmp(port p0, port p1);
63  extern int ports_eq(edge_t *, edge_t *);
64  extern void rec_reset_vlists(Agraph_t *);
65  extern void rec_save_vlists(Agraph_t *);
66  extern void reverse_edge(Agedge_t *);
67  extern void safe_other_edge(Agedge_t *);
68  extern void save_vlist(Agraph_t *);
69  extern void unmerge_oneway(Agedge_t *);
71  extern Agnode_t *virtual_node(Agraph_t *);
72  extern void virtual_weight(Agedge_t *);
73  extern void zapinlist(elist *, Agedge_t *);
74 
75 #if defined(_BLD_dot) && defined(_DLL)
76 # define extern __EXPORT__
77 #endif
78  extern Agraph_t* dot_root(void *);
79  extern void dot_concentrate(Agraph_t *);
80  extern void dot_mincross(Agraph_t *, int);
81  extern void dot_position(Agraph_t *, aspect_t*);
82  extern void dot_rank(Agraph_t *, aspect_t*);
83  extern void dot_sameports(Agraph_t *);
84  extern void dot_splines(Agraph_t *);
85 #undef extern
86 
87 #ifdef __cplusplus
88 }
89 #endif
90 #endif
void build_skeleton(graph_t *g, graph_t *subg)
Definition: cluster.c:342
int portcmp(port p0, port p1)
Definition: dotsplines.c:116
Definition: types.h:67
void delete_fast_node(Agraph_t *, Agnode_t *)
Definition: fastgr.c:229
void acyclic(graph_t *g)
Definition: acyclic.c:57
Agedge_t * find_flat_edge(Agnode_t *, Agnode_t *)
Definition: fastgr.c:57
void class1(graph_t *g)
Definition: class1.c:66
void fast_nodeapp(Agnode_t *, Agnode_t *)
Definition: fastgr.c:218
Agedge_t * find_fast_edge(Agnode_t *, Agnode_t *)
Definition: fastgr.c:42
void dot_scan_ranks(graph_t *g)
Definition: rank.c:204
void rec_reset_vlists(Agraph_t *)
Definition: mincross.c:1090
void dot_sameports(Agraph_t *)
Definition: sameport.c:34
Agnode_t * virtual_node(Agraph_t *)
Definition: fastgr.c:240
void decompose(graph_t *g, int pass)
Definition: decomp.c:200
void checkLabelOrder(graph_t *g)
Definition: mincross.c:287
void unmerge_oneway(Agedge_t *)
Definition: fastgr.c:353
void dot_splines(Agraph_t *)
Definition: dotsplines.c:519
void build_ranks(Agraph_t *, int)
Definition: mincross.c:1379
int ncross(Agraph_t *)
Definition: mincross.c:1741
void delete_flat_edge(Agedge_t *)
Definition: fastgr.c:267
void delete_fast_edge(Agedge_t *)
Definition: fastgr.c:115
void dot_concentrate(graph_t *g)
Definition: conc.c:197
void allocate_ranks(Agraph_t *)
Definition: mincross.c:1301
void rank1(graph_t *g)
Definition: rank.c:386
Agedge_t * virtual_edge(Agnode_t *, Agnode_t *, Agedge_t *)
Definition: fastgr.c:199
int is_cluster(Agraph_t *)
Definition: rank.c:585
void safe_other_edge(Agedge_t *)
Definition: fastgr.c:142
void fast_node(Agraph_t *, Agnode_t *)
Definition: fastgr.c:204
Definition: types.h:261
void other_edge(Agedge_t *)
Definition: fastgr.c:137
void mark_lowclusters(Agraph_t *root)
Definition: cluster.c:395
void dot_rank(Agraph_t *, aspect_t *)
Definition: rank.c:573
void merge_oneway(Agedge_t *, Agedge_t *)
Definition: fastgr.c:334
void merge_chain(graph_t *g, edge_t *e, edge_t *f, int flag)
Definition: class2.c:143
Agraph_t * dot_root(void *p)
Definition: dotinit.c:513
void rec_save_vlists(Agraph_t *)
Definition: mincross.c:1080
void flat_edge(Agraph_t *, Agedge_t *)
Definition: fastgr.c:260
Agedge_t * new_virtual_edge(Agnode_t *, Agnode_t *, Agedge_t *)
Definition: fastgr.c:162
void dot_cleanup(graph_t *g)
Definition: dotinit.c:180
void dot_init_node_edge(graph_t *g)
Definition: dotinit.c:75
void save_vlist(Agraph_t *)
Definition: mincross.c:1070
void zapinlist(elist *, Agedge_t *)
Definition: fastgr.c:100
void dot_layout(Agraph_t *g)
Definition: dotinit.c:507
void dot_compoundEdges(graph_t *g)
Definition: compound.c:494
void reverse_edge(edge_t *e)
Definition: acyclic.c:21
void install_in_rank(Agraph_t *, Agnode_t *)
Definition: mincross.c:1331
void class2(graph_t *g)
Definition: class2.c:172
void virtual_weight(Agedge_t *)
Definition: mincross.c:1900
Agedge_t * make_aux_edge(Agnode_t *, Agnode_t *, double, int)
Definition: position.c:173
int flat_edges(Agraph_t *)
Definition: flat.c:260
void enqueue_neighbors(nodequeue *q, node_t *n0, int pass)
Definition: mincross.c:1441
void dot_position(Agraph_t *, aspect_t *)
Definition: position.c:120
void expand_cluster(graph_t *subg)
Definition: cluster.c:282
int mergeable(edge_t *e, edge_t *f)
Definition: class2.c:164
int ports_eq(edge_t *, edge_t *)
Definition: position.c:1126
void mark_clusters(graph_t *g)
Definition: cluster.c:298
Agedge_t * fast_edge(Agedge_t *)
Definition: fastgr.c:74
void dot_mincross(Agraph_t *, int)
Definition: mincross.c:332
void install_cluster(graph_t *g, node_t *n, int pass, nodequeue *q)
Definition: cluster.c:379
int nonconstraint_edge(edge_t *e)
Definition: class1.c:23