Graphviz 16.1.3~dev.20261121.1645
Loading...
Searching...
No Matches
dotprocs.h
Go to the documentation of this file.
1/*************************************************************************
2 * Copyright (c) 2011 AT&T Intellectual Property
3 * All rights reserved. This program and the accompanying materials
4 * are made available under the terms of the Eclipse Public License v2.0
5 * which accompanies this distribution, and is available at
6 * https://www.eclipse.org/org/documents/epl-2.0/EPL-2.0.html
7 *
8 * Contributors: Details at https://graphviz.org
9 *************************************************************************/
10
11#pragma once
12
13#ifdef __cplusplus
14extern "C" {
15#endif
16
17#include <dotgen/aspect.h>
18#include <stdbool.h>
19#include <util/list.h>
20#include <util/unused.h>
21
22typedef LIST(Agnode_t *) node_queue_t;
23
24void acyclic(Agraph_t *);
27int build_ranks(Agraph_t *, int);
30void class1(Agraph_t *);
31void class2(Agraph_t *);
32void decompose(Agraph_t *, int);
36void dot_cleanup(graph_t *g);
37void dot_layout(Agraph_t *g);
39void dot_scan_ranks(graph_t *g);
40void enqueue_neighbors(node_queue_t *q, node_t *n0, int pass);
44void fast_node(Agraph_t *, Agnode_t *);
47void flat_edge(Agraph_t *, Agedge_t *);
48int flat_edges(Agraph_t *);
50int install_cluster(Agraph_t *, Agnode_t *, int, node_queue_t *);
54Agedge_t *make_aux_edge(Agnode_t *, Agnode_t *, double, int);
57bool mergeable(edge_t *e, edge_t *f);
58void merge_chain(Agraph_t *, Agedge_t *, Agedge_t *, bool);
62void other_edge(Agedge_t *);
63void rank1(graph_t *g);
64int portcmp(port p0, port p1);
65int ports_eq(edge_t *, edge_t *);
70void save_vlist(Agraph_t *);
74void zapinlist(elist *, Agedge_t *);
75
76Agraph_t *dot_root(void *);
83void dot_rank(Agraph_t *);
87
88#ifdef __cplusplus
89}
90#endif
void other_edge(Agedge_t *)
Definition fastgr.c:116
int flat_edges(Agraph_t *)
Definition flat.c:259
void delete_fast_node(Agraph_t *, Agnode_t *)
Definition fastgr.c:189
int build_ranks(Agraph_t *, int)
Definition mincross.c:1183
void class2(Agraph_t *)
Definition class2.c:155
int dot_mincross(Agraph_t *)
Definition mincross.c:330
void merge_chain(Agraph_t *, Agedge_t *, Agedge_t *, bool)
Definition class2.c:130
Agraph_t * dot_root(void *)
Definition dotinit.c:483
int dot_splines(Agraph_t *)
Definition dotsplines.c:486
void dot_scan_ranks(graph_t *g)
Definition rank.c:266
void decompose(Agraph_t *, int)
Definition decomp.c:108
void dot_compoundEdges(Agraph_t *)
Definition compound.c:432
void zapinlist(elist *, Agedge_t *)
remove e from list and fill hole with last member of list
Definition fastgr.c:96
void dot_sameports(Agraph_t *)
WUR int dot_concentrate(Agraph_t *)
Definition conc.c:202
bool nonconstraint_edge(Agedge_t *)
Definition class1.c:22
Agedge_t * virtual_edge(Agnode_t *, Agnode_t *, Agedge_t *)
Definition fastgr.c:170
void rank1(graph_t *g)
Definition rank.c:420
void safe_other_edge(Agedge_t *)
Definition fastgr.c:121
void dot_rank(Agraph_t *)
Definition rank.c:493
void virtual_weight(Agedge_t *)
Definition mincross.c:1704
int portcmp(port p0, port p1)
Definition dotsplines.c:128
void enqueue_neighbors(node_queue_t *q, node_t *n0, int pass)
Definition mincross.c:1259
void checkLabelOrder(graph_t *g)
Definition mincross.c:295
void allocate_ranks(Agraph_t *)
Definition mincross.c:1106
void flat_edge(Agraph_t *, Agedge_t *)
Definition fastgr.c:215
void fast_node(Agraph_t *, Agnode_t *)
Definition fastgr.c:175
void delete_fast_edge(Agedge_t *)
Definition fastgr.c:109
void merge_oneway(Agedge_t *, Agedge_t *)
Definition fastgr.c:245
int install_cluster(Agraph_t *, Agnode_t *, int, node_queue_t *)
Definition cluster.c:365
Agedge_t * make_aux_edge(Agnode_t *, Agnode_t *, double, int)
Definition position.c:179
Agedge_t * new_virtual_edge(Agnode_t *, Agnode_t *, Agedge_t *)
Definition fastgr.c:131
void class1(Agraph_t *)
Definition class1.c:63
void reverse_edge(Agedge_t *)
Definition acyclic.c:22
void dot_layout(Agraph_t *g)
Definition dotinit.c:473
void dot_init_node_edge(graph_t *g)
Definition dotinit.c:89
int expand_cluster(Agraph_t *)
Definition cluster.c:269
int install_in_rank(Agraph_t *, Agnode_t *)
Definition mincross.c:1134
void build_skeleton(Agraph_t *, Agraph_t *)
Definition cluster.c:329
Agedge_t * fast_edge(Agedge_t *)
Definition fastgr.c:71
void rec_reset_vlists(Agraph_t *)
Definition mincross.c:919
int ports_eq(edge_t *, edge_t *)
Definition position.c:1026
Agedge_t * find_flat_edge(Agnode_t *, Agnode_t *)
Definition fastgr.c:56
bool mergeable(edge_t *e, edge_t *f)
Definition class2.c:150
void dot_cleanup(graph_t *g)
Definition dotinit.c:181
void mark_clusters(Agraph_t *)
Definition cluster.c:288
Agedge_t * find_fast_edge(Agnode_t *, Agnode_t *)
Definition fastgr.c:43
void rec_save_vlists(Agraph_t *)
Definition mincross.c:911
void delete_flat_edge(Agedge_t *)
Definition fastgr.c:222
void acyclic(Agraph_t *)
Definition acyclic.c:58
void save_vlist(Agraph_t *)
Definition mincross.c:902
void mark_lowclusters(Agraph_t *)
Definition cluster.c:385
Agnode_t * virtual_node(Agraph_t *)
Definition fastgr.c:200
WUR int dot_position(Agraph_t *)
Definition position.c:121
type-generic dynamically expanding list
#define LIST(type)
Definition list.h:66
graph or subgraph
Definition cgraph.h:424
Definition types.h:251
Definition types.h:48
abstraction for squashing compiler warnings for unused symbols
#define WUR
Definition unused.h:43