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
|
#ifndef GRASS_DGRAPH_H
#define GRASS_DGRAPH_H
/* pg comes from "planar graph" */
/* every edge is directed. Nevertheless, we can visit it on both sides */
struct pg_edge {
int v1; /* first vertex */
int v2; /* second vertex */
char visited_left;
char visited_right;
char winding_left; /* winding numbers */
char winding_right;
};
struct pg_vertex {
double x; /* coordinates */
double y;
int ecount; /* number of neighbours */
int eallocated; /* size of the array bellow */
struct pg_edge **edges; /* array of pointers */
double *angles; /* precalculated angles with Ox */
};
struct planar_graph {
int vcount; /* number of vertices */
struct pg_vertex *v;
int ecount;
int eallocated;
struct pg_edge *e;
};
struct planar_graph* pg_create_struct(int n, int e);
void pg_destroy_struct(struct planar_graph *pg);
int pg_existsedge(struct planar_graph *pg, int v1, int v2);
void pg_addedge(struct planar_graph *pg, int v1, int v2);
struct planar_graph* pg_create(struct line_pnts *Points);
#endif
|
