#include "dot.h"
Include dependency graph for mincross.c:
Go to the source code of this file.
Defines | |
#define | MARK(v) ((v)->u.mark) |
#define | saveorder(v) ((v)->u.coord.x) |
#define | flatindex(v) ((v)->u.low) |
#define | ELT(M, i, j) (M->data[((i)*M->ncols)+(j)]) |
#define | VAL(node, port) (MC_SCALE * (node)->u.order + (port).order) |
#define | ORDINARY 0 |
#define | SINGLETON 1 |
#define | VIRTUALNODE 2 |
#define | NTYPES 3 |
#define | C_EE 1 |
#define | C_VS 2 |
#define | C_SS 2 |
#define | C_VV 4 |
Functions | |
void | dot_mincross (graph_t *g) |
void | save_vlist (graph_t *g) |
void | rec_save_vlists (graph_t *g) |
void | rec_reset_vlists (graph_t *g) |
void | allocate_ranks (graph_t *g) |
void | install_in_rank (graph_t *g, node_t *n) |
void | build_ranks (graph_t *g, int pass) |
void | enqueue_neighbors (nodequeue *q, node_t *n0, int pass) |
int | ncross (graph_t *g) |
void | virtual_weight (edge_t *e) |
#define C_EE 1 |
Definition at line 1340 of file mincross.c.
#define C_SS 2 |
Definition at line 1342 of file mincross.c.
#define C_VS 2 |
Definition at line 1341 of file mincross.c.
#define C_VV 4 |
Definition at line 1343 of file mincross.c.
#define ELT | ( | M, | |||
i, | |||||
j | ) | (M->data[((i)*M->ncols)+(j)]) |
Definition at line 128 of file mincross.c.
#define flatindex | ( | v | ) | ((v)->u.low) |
Definition at line 30 of file mincross.c.
#define MARK | ( | v | ) | ((v)->u.mark) |
Definition at line 28 of file mincross.c.
Referenced by build_ranks(), enqueue_neighbors(), and findCComp().
#define NTYPES 3 |
Definition at line 1338 of file mincross.c.
#define ORDINARY 0 |
Definition at line 1335 of file mincross.c.
#define saveorder | ( | v | ) | ((v)->u.coord.x) |
Definition at line 29 of file mincross.c.
#define SINGLETON 1 |
Definition at line 1336 of file mincross.c.
Definition at line 1264 of file mincross.c.
#define VIRTUALNODE 2 |
Definition at line 1337 of file mincross.c.
void allocate_ranks | ( | graph_t * | g | ) |
Definition at line 790 of file mincross.c.
References agfstnode(), agfstout(), agnxtnode(), agnxtout(), free(), GD_maxrank, GD_minrank, GD_rank, Agedge_t::head, N_NEW, ND_rank, and Agedge_t::tail.
Referenced by expand_cluster().
void build_ranks | ( | graph_t * | g, | |
int | pass | |||
) |
Definition at line 859 of file mincross.c.
References AGERR, agerr(), assert, CLUSTER, dequeue(), enqueue(), enqueue_neighbors(), exchange, FALSE, free_queue(), GD_flip, GD_maxrank, GD_minrank, GD_n_nodes, GD_nlist, GD_rank, Agedge_t::head, install_cluster(), install_in_rank(), MARK, ncross(), ND_in, ND_next, ND_out, ND_ranktype, new_queue(), NULL, Agraph_t::root, Agedge_t::tail, and TRUE.
Referenced by expand_cluster().
void dot_mincross | ( | graph_t * | g | ) |
Definition at line 75 of file mincross.c.
References agget(), GD_clust, GD_comp, GD_n_cluster, mapbool(), mark_lowclusters(), and TRUE.
Referenced by dot_layout().
Definition at line 921 of file mincross.c.
References enqueue(), FALSE, Agedge_t::head, MARK, ND_in, ND_out, Agedge_t::tail, and TRUE.
Referenced by build_ranks(), and install_cluster().
Definition at line 820 of file mincross.c.
References AGERR, agerr(), assert, GD_maxrank, GD_minrank, GD_nlist, GD_rank, Agnode_t::name, Agraph_t::name, ND_next, ND_order, ND_rank, and NULL.
Referenced by build_ranks(), and install_cluster().
int ncross | ( | graph_t * | g | ) |
Definition at line 1199 of file mincross.c.
References GD_maxrank, GD_minrank, GD_rank, and TRUE.
Referenced by build_ranks().
void rec_reset_vlists | ( | graph_t * | g | ) |
Definition at line 655 of file mincross.c.
References assert, GD_clust, GD_maxrank, GD_minrank, GD_n_cluster, GD_rank, GD_rankleader, ND_order, ND_rank, rec_reset_vlists(), and Agraph_t::root.
Referenced by flat_edges(), and rec_reset_vlists().
void rec_save_vlists | ( | graph_t * | g | ) |
Definition at line 645 of file mincross.c.
References GD_clust, GD_n_cluster, rec_save_vlists(), and save_vlist().
Referenced by flat_edges(), and rec_save_vlists().
void save_vlist | ( | graph_t * | g | ) |
Definition at line 635 of file mincross.c.
References GD_maxrank, GD_minrank, GD_rank, and GD_rankleader.
Referenced by rec_save_vlists().
void virtual_weight | ( | edge_t * | e | ) |
Definition at line 1360 of file mincross.c.
References ED_weight, Agedge_t::head, and Agedge_t::tail.