Related to #1785.
#ifndef _BFS_H_
#define _BFS_H_
-#include "defs.h"
+#include <neatogen/defs.h>
#ifdef __cplusplus
class Queue {
#ifndef CLOSEST_H
#define CLOSEST_H
-#include "defs.h"
+#include <neatogen/defs.h>
extern void closest_pairs2graph(double *, int, int, vtx_data **);
#ifndef _CG_H_
#define _CG_H_
-#include "defs.h"
+#include <neatogen/defs.h>
/*************************
* C.G. method - SPARSE *
#ifndef _DEFS_H_
#define _DEFS_H_
-#include "neato.h"
+#include <neatogen/neato.h>
-#include "sparsegraph.h"
+#include <neatogen/sparsegraph.h>
#ifdef DIGCOLA
#ifdef IPSEPCOLA
#ifndef DELAUNAY_H
#define DELAUNAY_H
-#include "sparsegraph.h"
+#include <neatogen/sparsegraph.h>
typedef struct {
int nedges; /* no. of edges in triangulation */
#ifndef DIGCOLA_H
#define DIGCOLA_H
-#include <defs.h>
+#include <neatogen/defs.h>
#ifdef DIGCOLA
extern int compute_y_coords(vtx_data*, int, double*, int);
extern int compute_hierarchy(vtx_data*, int, double, double,
#ifndef _DIJKSTRA_H_
#define _DIJKSTRA_H_
-#include "defs.h"
-#include "sgd.h"
+#include <neatogen/defs.h>
+#include <neatogen/sgd.h>
#ifdef __cplusplus
void dijkstra(int vertex, vtx_data * graph, int n, DistType * dist);
#ifndef EDGES_H
#define EDGES_H
-#include "site.h"
+#include <neatogen/site.h>
typedef struct Edge {
double a, b, c; /* edge on line ax + by = c */
double **(&new_coords));
#else
-#include <defs.h>
+#include <neatogen/defs.h>
extern void embed_graph(vtx_data * graph, int n, int dim, DistType ***,
int);
#ifndef HEAP_H
#define HEAP_H
-#include "hedges.h"
+#include <neatogen/hedges.h>
extern void PQinitialize(void);
extern void PQcleanup(void);
#ifndef HEDGES_H
#define HEDGES_H
-#include "site.h"
-#include "edges.h"
+#include <neatogen/site.h>
+#include <neatogen/edges.h>
typedef struct Halfedge {
struct Halfedge *ELleft, *ELright;
#ifndef INFO_H
#define INFO_H
-#include "voronoi.h"
-#include "poly.h"
+#include <neatogen/voronoi.h>
+#include <neatogen/poly.h>
typedef struct ptitem { /* Point list */
struct ptitem *next;
#ifndef KKUTILS_H_
#define KKUTILS_H_
-#include "defs.h"
+#include <neatogen/defs.h>
#ifdef __cplusplus
#ifndef _MATRIX_OPS_H_
#define _MATRIX_OPS_H_
-#include "sparsegraph.h"
+#include <neatogen/sparsegraph.h>
extern void cpvec(double *, int, int, double *);
extern double dot(double *, int, int, double *);
#include "render.h"
#include "pathplan.h"
-#include "neatoprocs.h"
-#include "adjust.h"
+#include <neatogen/neatoprocs.h>
+#include <neatogen/adjust.h>
#endif /* NEATO_H */
#ifdef __cplusplus
extern "C" {
#endif
-#include "adjust.h"
+#include <neatogen/adjust.h>
extern void avoid_cycling(graph_t *, Agnode_t *, double *);
extern int checkStart(graph_t * G, int nG, int);
#ifndef PCA_H
#define PCA_H
-#include "defs.h"
+#include <neatogen/defs.h>
extern void PCA_alloc(DistType **, int, int, double **, int);
extern boolean iterativePCA_1D(double **, int, int, double *);
#ifndef POLY_H
#define POLY_H
-#include "geometry.h"
+#include <neatogen/geometry.h>
typedef struct {
Point origin;
#ifdef DIGCOLA
-#include "defs.h"
-#include "digcola.h"
+#include <neatogen/defs.h>
+#include <neatogen/digcola.h>
#ifdef MOSEK
-#include "mosek_quad_solve.h"
+#include <neatogen/mosek_quad_solve.h>
#endif /* MOSEK */
typedef struct CMajEnvVPSC {
#ifndef SITE_H
#define SITE_H
-#include "geometry.h"
+#include <neatogen/geometry.h>
/* Sites are also used as vertices on line segments */
typedef struct Site {
#ifndef STRESS_H
#define STRESS_H
-#include "defs.h"
+#include <neatogen/defs.h>
#define tolerance_cg 1e-3
#ifndef VORONOI_H
#define VORONOI_H
-#include "site.h"
+#include <neatogen/site.h>
extern void voronoi(int, Site * (*)(void));
#ifndef _HIERARCHY_H_
#define _HIERARCHY_H_
-#include "sparsegraph.h"
+#include <neatogen/sparsegraph.h>
typedef struct {
int nedges; // degree, including self-loop