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
|
/*************************************************************************
* Copyright (c) 2011 AT&T Intellectual Property
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* https://www.eclipse.org/legal/epl-v10.html
*
* Contributors: Details at https://graphviz.org
*************************************************************************/
#pragma once
#include <neatogen/sparsegraph.h>
#include <stdbool.h>
#include <stddef.h>
typedef struct {
int nedges; // degree, including self-loop
int *edges; // neighbors; edges[0] = self
int size; // no. of original nodes contained
int active_level; // Node displayed iff active_level == node's level
int globalIndex; // Each node has a unique ID over all levels
// position of node in universal coordinate system
float x_coord;
float y_coord;
// position of node in physical (device) coordinate system
float physical_x_coord;
float physical_y_coord;
//previous coords and active level (for animation)
float old_physical_x_coord;
float old_physical_y_coord;
int old_active_level;
} ex_vtx_data;
typedef struct {
int nlevels;
v_data ** graphs;
ex_vtx_data ** geom_graphs;
int * nvtxs;
int * nedges;
/* Node i on level k is mapped to coarse node v2cv[k][i] on level k+1
*/
int ** v2cv;
/* Coarse node i on level k contains nodes cv2v[k][2*i] and
* cv2v[k][2*i+1] on level k-1. If it contains only 1 node, then
* cv2v[k][2*i+1] will be -1
*/
int ** cv2v;
int maxNodeIndex;
} Hierarchy;
typedef struct {
int num_fine_nodes; /* 50 */
double coarsening_rate; /* 2.5 */
} levelparms_t;
Hierarchy *create_hierarchy(v_data *graph, int nvtxs, int nedges,
ex_vtx_data *geom_graph, int ngeom_edges,
bool dist2_limit);
void set_active_levels(Hierarchy*, int*, int, levelparms_t*);
double find_closest_active_node(Hierarchy*, double x, double y, int*);
size_t extract_active_logical_coords(Hierarchy *hierarchy, int node, int level,
double *x_coords, double *y_coords, size_t counter);
int set_active_physical_coords(Hierarchy *, int node, int level,
double *x_coords, double *y_coords, int counter);
void init_active_level(Hierarchy* hierarchy, int level);
// creating a geometric graph:
int init_ex_graph(v_data * graph1, v_data * graph2, int n,
double *x_coords, double *y_coords, ex_vtx_data ** gp);
// layout distortion:
void rescale_layout_polar(double * x_coords, double * y_coords,
double * x_foci, double * y_foci, int num_foci, size_t n, int interval,
double width, double height, double distortion);
void find_physical_coords(Hierarchy *, int, int, float *x, float *y);
void find_old_physical_coords(Hierarchy *hierarchy, int level, int node,
float *x, float *y);
int find_active_ancestor(Hierarchy*, int, int);
void find_active_ancestor_info(Hierarchy * hierarchy, int level, int node, int *levell,int *nodee);
void quicksort_place(double *place, int *ordering, size_t size);
|
