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
|
/**
* Authors:
* Tim Dwyer <tgdwyer@gmail.com>
*
* Copyright (C) 2005 Authors
*
* This version is released under the CPL (Common Public License) with
* the Graphviz distribution.
* A version is also available under the LGPL as part of the Adaptagrams
* project: http://sourceforge.net/projects/adaptagrams.
* If you make improvements or bug fixes to this code it would be much
* appreciated if you could also contribute those changes back to the
* Adaptagrams repository.
*/
/**********************************************************
* Written by Tim Dwyer for the graphviz package *
* https://graphviz.org *
* *
**********************************************************/
#pragma once
#include <util/api.h>
#ifdef __cplusplus
extern "C" {
#endif
#ifdef DIGCOLA
#include <neatogen/defs.h>
#include <neatogen/digcola.h>
#include <stdbool.h>
typedef struct CMajEnvVPSC {
float **A;
int nv; /* number of actual vars */
int nldv; /* number of dummy nodes included in lap matrix */
int ndv; /* number of dummy nodes not included in lap matrix */
Variable **vs;
int m; /* total number of constraints for next iteration */
int gm; /* number of global constraints */
Constraint **cs;
/* global constraints are persistent throughout optimisation process */
Constraint **gcs;
VPSC *vpsc;
float *fArray1; /* utility arrays - reusable memory */
float *fArray2;
float *fArray3;
} CMajEnvVPSC;
PRIVATE CMajEnvVPSC* initCMajVPSC(int n, float *packedMat, vtx_data* graph, ipsep_options *opt, int diredges);
PRIVATE int constrained_majorization_vpsc(CMajEnvVPSC*, float*, float*, int);
PRIVATE void deleteCMajEnvVPSC(CMajEnvVPSC *e);
PRIVATE void generateNonoverlapConstraints(
CMajEnvVPSC* e,
float nsizeScale,
float** coords,
int k,
bool transitiveClosure,
ipsep_options* opt
);
PRIVATE void removeoverlaps(int,float**,ipsep_options*);
typedef struct {
int *nodes;
int num_nodes;
} DigColaLevel;
/*
* unpack the "ordering" array into an array of DigColaLevel (as defined above)
*/
PRIVATE DigColaLevel* assign_digcola_levels(int *ordering, int n, int *level_inds, int num_divisions);
PRIVATE int get_num_digcola_constraints(DigColaLevel *levels, int num_levels);
#endif
#ifdef __cplusplus
}
#endif
|
