File: span.c

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 (125 lines) | stat: -rw-r--r-- 3,360 bytes parent folder | download | duplicates (2)
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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
/* LIBDGL -- a Directed Graph Library implementation
 * Copyright (C) 2002 Roberto Micarelli
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
 */

/*
 * Source best viewed with tabstop=4
 */

#include <stdio.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
#include <stdlib.h>
#include <fcntl.h>
#include <time.h>
#include <errno.h>
#include <math.h>

#include "../type.h"
#include "../graph.h"

#include "opt.h"

static int _clipper(dglGraph_s *pgraphIn, dglGraph_s *pgraphOut,
                    dglSpanClipInput_s *pArgIn, dglSpanClipOutput_s *pArgOut,
                    void *pvArg)
{
    return 0;
}

int main(int argc, char **argv)
{
    dglGraph_s graph, graphOut;
    dglInt32_t nVertex;
    int nret, fd;

    /* program options
     */
    char *pszGraph;
    char *pszGraphOut;
    char *pszVertex;

    GNO_BEGIN /* short   long                default     variable        help */
        GNO_OPTION("g", "graph", NULL, &pszGraph, "Input Graph file")
        GNO_OPTION("o", "graphout", NULL, &pszGraphOut, "Output Graph file")
        GNO_OPTION("v", "vertex", NULL, &pszVertex, "Vertex Node Id")
    GNO_END
    if (GNO_PARSE(argc, argv) < 0) {
        return 1;
    }
    /*
     * options parsed
     */

    if (pszVertex == NULL) {
        GNO_HELP("span usage");
        return 1;
    }
    nVertex = atol(pszVertex);

    printf("Graph read:\n");
    if ((fd = open(pszGraph, O_RDONLY)) < 0) {
        perror("open");
        return 1;
    }
    nret = dglRead(&graph, fd);
    if (nret < 0) {
        fprintf(stderr, "dglRead error: %s\n", dglStrerror(&graph));
        return 1;
    }
    close(fd);
    printf("Done.\n");

    printf("Graph depth spanning:\n");
    nret = dglDepthSpanning(&graph, &graphOut, nVertex, _clipper, NULL);
    if (nret < 0) {
        fprintf(stderr, "dglDepthSpanning error: %s\n", dglStrerror(&graph));
        return 1;
    }
    printf("Done.\n");

    printf("Graph flatten:\n");
    nret = dglFlatten(&graphOut);
    printf("Done.\n");

    if (dglGet_EdgeCount(&graphOut) > 0) {

        if (pszGraphOut) {
            printf("Graph write:\n");
            if ((fd = open(pszGraphOut, O_WRONLY | O_CREAT | O_TRUNC, 0666)) <
                0) {
                perror("open");
                return 1;
            }
            dglWrite(&graphOut, fd);
            if (nret < 0) {
                fprintf(stderr, "dglWrite error: %s\n", dglStrerror(&graphOut));
                return 1;
            }
            close(fd);
            printf("Done.\n");
        }
    }
    else {
        printf("Empty span. No output produced.\n");
    }

    dglRelease(&graph);
    dglRelease(&graphOut);
    return 0;
}