File: alloc.h

package info (click to toggle)
grass 8.4.2-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 277,040 kB
  • sloc: ansic: 460,798; python: 227,732; cpp: 42,026; sh: 11,262; makefile: 7,007; xml: 3,637; sql: 968; lex: 520; javascript: 484; yacc: 450; asm: 387; perl: 157; sed: 25; objc: 6; ruby: 4
file content (20 lines) | stat: -rw-r--r-- 795 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
typedef struct {
    int cat;  /* category number */
    int node; /* node number */
} CENTER;

typedef struct {
    int center;  /* nearest center, initially -1 */
    double cost; /* costs from this center, initially not defined */
    int edge;    /* edge to follow from this node */
} NODE;

int alloc_from_centers_loop_tt(struct Map_info *Map, NODE *Nodes,
                               CENTER *Centers, int ncenters, int tucfield);
int alloc_to_centers_loop_tt(struct Map_info *Map, NODE *Nodes, CENTER *Centers,
                             int ncenters, int tucfield);

int alloc_from_centers(dglGraph_s *graph, NODE *Nodes, CENTER *Centers,
                       int ncenters);
int alloc_to_centers(dglGraph_s *graph, NODE *Nodes, CENTER *Centers,
                     int ncenters);