functions.c File Reference

#include "bary.h"

Include dependency graph for functions.c:

Go to the source code of this file.

Defines
#define	STATIC
Functions
STATIC int	layer_crossing (int level)
STATIC void	array_to_level (int i)
STATIC void	calc_all_layers_crossings (void)
STATIC int	graph_crossings (void)
STATIC void	level_to_array (int i, int dir)

---

Define Documentation

#define STATIC

Definition at line 2 of file functions.c.

---

Function Documentation

STATIC void array_to_level (  int  i  )

Definition at line 64 of file functions.c. References GNLIST, sort_array, STATIC, and tmp_layer. Referenced by phase2_down(), phase2_up(), resort_down_layer(), resort_up_layer(), tree_horizontal_order(), and unmerge_connected_parts(). { int j; GNLIST hn; ; j = 0; hn = ((tmp_layer[i]).succlist); while (hn) { ((hn)->node) = sort_array[j++]; hn = ((hn)->next); } }

STATIC void calc_all_layers_crossings (  void   )

Definition at line 71 of file functions.c. References layer_crossing(), maxdepth, STATIC, and tmp_layer. Referenced by checkcrossing(). { int i; for (i = 0; i <= maxdepth; i++) ((tmp_layer[i]).cross) = layer_crossing (i); }

STATIC int graph_crossings (  void   )

Definition at line 77 of file functions.c. References maxdepth, STATIC, and tmp_layer. Referenced by barycentering(), checkcrossing(), phase2_down(), and phase2_up(). { int i; int sumC; sumC = 0; for (i = 0; i <= maxdepth; i++) sumC += ((tmp_layer[i]).cross); return (sumC); }

STATIC int layer_crossing (  int  level  )

Definition at line 5 of file functions.c. References ADJEDGE, finish_lower(), finish_upper(), GNLIST, lower_list, lower_list_end, nr_tcrossings, size_lower_list, size_upper_list, STATIC, tmp_layer, upper_list, and upper_list_end. Referenced by calc_all_layers_crossings(), phase2_down(), phase2_up(), resort_down_layer(), and resort_up_layer(). { GNLIST vl1, vl2; ADJEDGE a; int i; vl1 = ((tmp_layer[level]).succlist); while (vl1) { ((((vl1)->node))->tmpadj) = ((((vl1)->node))->succ); vl1 = ((vl1)->next); } vl2 = ((tmp_layer[level + 1]).succlist); while (vl2) { ((((vl2)->node))->tmpadj) = ((((vl2)->node))->pred); vl2 = ((vl2)->next); } i = 1; vl1 = ((tmp_layer[level]).succlist); while (vl1) { ((((vl1)->node))->Vpointer) = ((void *) 0); ((((vl1)->node))->position) = i; a = ((((vl1)->node))->succ); while (a) { (((((((((a)->kante))->end)))->tmpadj))->kante) = ((a)->kante); (((((((a)->kante))->end)))->tmpadj) = (((((((((a)->kante))->end)))->tmpadj))->next); a = ((a)->next); } vl1 = ((vl1)->next); i = i + 2; } i = 2; vl2 = ((tmp_layer[level + 1]).succlist); while (vl2) { ((((vl2)->node))->Vpointer) = ((void *) 0); ((((vl2)->node))->position) = i; a = ((((vl2)->node))->pred); while (a) { (((((((((a)->kante))->start)))->tmpadj))->kante) = ((a)->kante); (((((((a)->kante))->start)))->tmpadj) = (((((((((a)->kante))->start)))->tmpadj))->next); a = ((a)->next); } vl2 = ((vl2)->next); i = i + 2; } nr_tcrossings = 0; size_lower_list = size_upper_list = 0; lower_list = lower_list_end = ((void *) 0); upper_list = upper_list_end = ((void *) 0); vl1 = ((tmp_layer[level]).succlist); vl2 = ((tmp_layer[level + 1]).succlist); while ((vl1) || (vl2)) { if (vl1) { finish_upper (((vl1)->node)); vl1 = ((vl1)->next); } if (vl2) { finish_lower (((vl2)->node)); vl2 = ((vl2)->next); } }; return (nr_tcrossings); }

STATIC void level_to_array (  int  i, int  dir )

Definition at line 86 of file functions.c. References GNLIST, sort_array, STATIC, and tmp_layer. Referenced by phase2_down(), phase2_up(), resort_down_layer(), resort_up_layer(), and tree_horizontal_order(). { int j; GNLIST hn; ; exit(0); assert(tmp_layer); hn = ((tmp_layer[i]).succlist); j = 0; while (hn) { sort_array[j++] = ((hn)->node); hn = ((hn)->next); } if (dir == 'd') { hn = ((tmp_layer[i - 1]).succlist); } else { hn = ((tmp_layer[i + 1]).succlist); } j = 1; while (hn) { ((((hn)->node))->position) = j++; hn = ((hn)->next); } }

---