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
|
/* $Id: dotprocs.h,v 1.15 2009/06/03 01:10:52 ellson Exp $ $Revision: 1.15 $ */
/* 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 DOTPROCS_H
#define DOTPROCS_H
#ifdef _BEGIN_EXTERNS_
_BEGIN_EXTERNS_ /* public data */
#endif
/* tabs at 8, or you're a sorry loser */
#ifdef __cplusplus
extern "C" {
#endif
#include "aspect.h"
extern void acyclic(Agraph_t *);
extern void allocate_ranks(Agraph_t *);
extern void build_ranks(Agraph_t *, int);
extern void build_skeleton(Agraph_t *, Agraph_t *);
extern void class1(Agraph_t *);
extern void class2(Agraph_t *);
extern void decompose(Agraph_t *, int);
extern void delete_fast_edge(Agedge_t *);
extern void delete_fast_node(Agraph_t *, Agnode_t *);
extern void delete_flat_edge(Agedge_t *);
extern void dot_cleanup(graph_t * g);
extern void dot_layout(Agraph_t * g);
extern void dot_init_node_edge(graph_t * g);
extern void dot_scan_ranks(graph_t * g);
extern void expand_cluster(Agraph_t *);
extern Agedge_t *fast_edge(Agedge_t *);
extern void fast_node(Agraph_t *, Agnode_t *);
extern void fast_nodeapp(Agnode_t *, Agnode_t *);
extern Agedge_t *find_fast_edge(Agnode_t *, Agnode_t *);
extern Agedge_t *find_flat_edge(Agnode_t *, Agnode_t *);
extern void flat_edge(Agraph_t *, Agedge_t *);
extern int flat_edges(Agraph_t *);
extern void install_cluster(Agraph_t *, Agnode_t *, int, nodequeue *);
extern void install_in_rank(Agraph_t *, Agnode_t *);
extern int is_cluster(Agraph_t *);
extern void dot_compoundEdges(Agraph_t *);
extern Agedge_t *make_aux_edge(Agnode_t *, Agnode_t *, double, int);
extern void mark_clusters(Agraph_t *);
extern void mark_lowclusters(Agraph_t *);
extern int mergeable(edge_t * e, edge_t * f);
extern void merge_chain(Agraph_t *, Agedge_t *, Agedge_t *, int);
extern void merge_oneway(Agedge_t *, Agedge_t *);
extern int ncross(Agraph_t *);
extern Agedge_t *new_virtual_edge(Agnode_t *, Agnode_t *, Agedge_t *);
extern int nonconstraint_edge(Agedge_t *);
extern void other_edge(Agedge_t *);
extern void rank1(graph_t * g);
extern int portcmp(port p0, port p1);
extern int ports_eq(edge_t *, edge_t *);
extern void rec_reset_vlists(Agraph_t *);
extern void rec_save_vlists(Agraph_t *);
extern void reverse_edge(Agedge_t *);
extern void safe_other_edge(Agedge_t *);
extern void save_vlist(Agraph_t *);
extern void unmerge_oneway(Agedge_t *);
extern Agedge_t *virtual_edge(Agnode_t *, Agnode_t *, Agedge_t *);
extern Agnode_t *virtual_node(Agraph_t *);
extern void virtual_weight(Agedge_t *);
extern void zapinlist(elist *, Agedge_t *);
#if defined(_BLD_dot) && defined(_DLL)
# define extern __EXPORT__
#endif
extern void dot_concentrate(Agraph_t *);
extern void dot_mincross(Agraph_t *, int);
extern void dot_position(Agraph_t *, aspect_t*);
extern void dot_rank(Agraph_t *, aspect_t*);
extern void dot_sameports(Agraph_t *);
extern void dot_splines(Agraph_t *);
#undef extern
#ifdef _END_EXTERNS_
_END_EXTERNS_
#endif
#ifdef __cplusplus
}
#endif
#endif
|
