Graphviz 12.0.1~dev.20240716.0800
Loading...
Searching...
No Matches
make_map.h
Go to the documentation of this file.
1/*************************************************************************
2 * Copyright (c) 2011 AT&T Intellectual Property
3 * All rights reserved. This program and the accompanying materials
4 * are made available under the terms of the Eclipse Public License v1.0
5 * which accompanies this distribution, and is available at
6 * https://www.eclipse.org/legal/epl-v10.html
7 *
8 * Contributors: Details at https://graphviz.org
9 *************************************************************************/
10
11#pragma once
12
13#include <sparse/SparseMatrix.h>
14#include <cgraph/cgraph.h>
15#include <stdbool.h>
16
18 bool include_OK_points, int n, int dim, double *x, double *sizes,
19 int *grouping, SparseMatrix graph, double bounding_box_margin, int nrandom,
20 int *nart, int nedgep, double shore_depth_tol, int *nverts, double **x_poly,
21 SparseMatrix *poly_lines, SparseMatrix *polys, int **polys_groups,
22 SparseMatrix *poly_point_map, SparseMatrix *country_graph,
23 int highlight_cluster);
24
25void improve_contiguity(int n, int dim, int *grouping, SparseMatrix poly_point_map, double *x, SparseMatrix graph);
26
27void plot_dot_map(Agraph_t* gr, int n, int dim, double *x, SparseMatrix polys,
28 SparseMatrix poly_lines, double line_width,
29 const char *line_color, double *x_poly, int *polys_groups,
30 char **labels, float *fsz, float *r, float *g, float *b,
31 const char* opacity, SparseMatrix A, FILE*);
32
33void map_optimal_coloring(int seed, SparseMatrix A, float *rgb_r, float *rgb_g, float *rgb_b);
34void map_palette_optimal_coloring(char *color_scheme, SparseMatrix A,
35 float **rgb_r, float **rgb_g, float **rgb_b);
36
37#define neighbor(t, i, edim, elist) elist[(edim)*(t)+i]
38#define edge_head(e) edge_table[2*(e)]
39#define edge_tail(e) edge_table[2*(e)+1]
40#define cycle_prev(e) cycle[2*(e)]
41#define cycle_next(e) cycle[2*(e)+1]
abstract graph C library, Cgraph API
static long seed
Definition exeval.c:1035
#define A(n, t)
Definition expr.h:76
Agraph_t * graph(char *name)
Definition gv.cpp:31
void make_map_from_rectangle_groups(bool include_OK_points, int n, int dim, double *x, double *sizes, int *grouping, SparseMatrix graph, double bounding_box_margin, int nrandom, int *nart, int nedgep, double shore_depth_tol, int *nverts, double **x_poly, SparseMatrix *poly_lines, SparseMatrix *polys, int **polys_groups, SparseMatrix *poly_point_map, SparseMatrix *country_graph, int highlight_cluster)
Definition make_map.c:1225
void plot_dot_map(Agraph_t *gr, int n, int dim, double *x, SparseMatrix polys, SparseMatrix poly_lines, double line_width, const char *line_color, double *x_poly, int *polys_groups, char **labels, float *fsz, float *r, float *g, float *b, const char *opacity, SparseMatrix A, FILE *)
Definition make_map.c:326
void map_optimal_coloring(int seed, SparseMatrix A, float *rgb_r, float *rgb_g, float *rgb_b)
Definition make_map.c:93
void improve_contiguity(int n, int dim, int *grouping, SparseMatrix poly_point_map, double *x, SparseMatrix graph)
Definition make_map.c:115
void map_palette_optimal_coloring(char *color_scheme, SparseMatrix A, float **rgb_r, float **rgb_g, float **rgb_b)
Definition make_map.c:34
graph or subgraph
Definition cgraph.h:425