gvcolor.c

Go to the documentation of this file.

 
/*************************************************************************
 * Copyright (c) 2011 AT&T Intellectual Property 
 * All rights reserved. This program and the accompanying materials
 * are made available under the terms of the Eclipse Public License v1.0
 * which accompanies this distribution, and is available at
 * https://www.eclipse.org/legal/epl-v10.html
 *
 * Contributors: Details at https://graphviz.org
 *************************************************************************/
 
 
/*
 * Written by Stephen North
 * Updated by Emden Gansner
 */
 
/* if NC changes, a bunch of scanf calls below are in trouble */
#define NC      3               /* size of HSB color vector */
 
#include <cgraph/cgraph.h>
#include <cgraph/ingraphs.h>
#include "colorxlate.h"
#include <math.h>
#include <stdbool.h>
#include <stdlib.h>
#include <util/agxbuf.h>
#include <util/gv_math.h>
#include <util/exit.h>
#include <util/list.h>
 
typedef struct {
    Agrec_t h;
    double relrank;     /* coordinate of its rank, smaller means lower rank */
    double x[NC];       /* color vector */
} Agnodeinfo_t;
 
#define ND_relrank(n) (((Agnodeinfo_t*)((n)->base.data))->relrank)
#define ND_x(n) (((Agnodeinfo_t*)((n)->base.data))->x)
 
#include <stdio.h>
 
#include <getopt.h>
 
double Defcolor[NC] = { 0.0, 0.0, 1.0 };        /* white */
int Forward = 1;                /* how to propagate colors w.r.t. ranks */
int LR = 0;                     /* rank orientation */
 
int AdjustSaturation;
double MinRankSaturation;
double MaxRankSaturation;
 
static int cmpf(const void *x, const void *y) {
  Agnode_t *const *n0 = x;
  Agnode_t *const *n1 = y;
    double relrank0 = ND_relrank(*n0);
    double relrank1 = ND_relrank(*n1);
    if (relrank0 < relrank1)
        return -1;
    if (relrank0 > relrank1)
        return 1;
    return 0;
}
 
static void setcolor(char *p, double *v)
{
    agxbuf buf = {0};
    if (sscanf(p, "%lf %lf %lf", v, v + 1, v + 2) != 3 && p[0]) {
        colorxlate(p, &buf);
        sscanf(agxbuse(&buf), "%lf %lf %lf", v, v + 1, v + 2);
    }
    agxbfree(&buf);
}
 
static char **Files;
 
static char *useString = "Usage: gvcolor [-?] <files>\n\
  -? - print usage\n\
If no files are specified, stdin is used";
 
static void usage(int v)
{
    puts(useString);
    graphviz_exit(v);
}
 
static void init(int argc, char *argv[])
{
    int c;
 
    opterr = 0;
    while ((c = getopt(argc, argv, ":?")) != -1) {
        switch (c) {
        case '?':
            if (optopt == '\0' || optopt == '?')
                usage(0);
            fprintf(stderr, "gvcolor: option -%c unrecognized\n", optopt);
            usage(1);
            break;
        default:
            fprintf(stderr, "gvcolor: unexpected error\n");
            graphviz_exit(EXIT_FAILURE);
        }
    }
    argv += optind;
    argc -= optind;
 
    if (argc)
        Files = argv;
}
 
static void color(Agraph_t * g)
{
    char *p;
    double x, y, maxrank = 0.0;
    double lowsat, highsat;
 
    if (agattr_text(g, AGNODE, "pos", 0) == NULL) {
        fprintf(stderr,
                "graph must be run through 'dot' before 'gvcolor'\n");
        graphviz_exit(1);
    }
    aginit(g, AGNODE, "nodeinfo", sizeof(Agnodeinfo_t), true);
    if (agattr_text(g, AGNODE, "style", 0) == NULL)
        agattr_text(g, AGNODE, "style", "filled");
    if ((p = agget(g, "Defcolor")))
        setcolor(p, Defcolor);
 
    if ((p = agget(g, "rankdir")) && p[0] == 'L')
        LR = 1;
    if ((p = agget(g, "flow")) && p[0] == 'b')
        Forward = 0;
    if ((p = agget(g, "saturation"))) {
        if (sscanf(p, "%lf,%lf", &lowsat, &highsat) == 2) {
            MinRankSaturation = lowsat;
            MaxRankSaturation = highsat;
            AdjustSaturation = 1;
        }
    }
 
    /* assemble the sorted list of nodes and store the initial colors */
    LIST(Agnode_t *) nlist = {0};
    for (Agnode_t *n = agfstnode(g); n; n = agnxtnode(g, n)) {
        LIST_APPEND(&nlist, n);
        if ((p = agget(n, "color")))
            setcolor(p, ND_x(n));
        p = agget(n, "pos");
        sscanf(p, "%lf,%lf", &x, &y);
        ND_relrank(n) = LR ? x : y;
        maxrank = fmax(maxrank, ND_relrank(n));
    }
    if (LR != Forward)
        for (size_t i = 0; i < LIST_SIZE(&nlist); i++) {
            Agnode_t *const n = LIST_GET(&nlist, i);
            ND_relrank(n) = maxrank - ND_relrank(n);
        }
    LIST_SORT(&nlist, cmpf);
 
    /* this is the pass that pushes the colors through the edges */
    for (size_t i = 0; i < LIST_SIZE(&nlist); i++) {
        Agnode_t *const n = LIST_GET(&nlist, i);
 
        /* skip nodes that were manually colored */
        int cnt = 0;
        for (int j = 0; j < NC; j++)
            if (!is_exactly_zero(ND_x(n)[j]))
                cnt++;
        if (cnt > 0)
            continue;
 
        double sum[NC] = {0};
        cnt = 0;
        for (Agedge_t *e = agfstedge(g, n); e; e = agnxtedge(g, e, n)) {
            Agnode_t *v = aghead(e);
            if (v == n)
                v = agtail(e);
            if (ND_relrank(v) - ND_relrank(n) - 0.01 < 0) {
                double t = 0.0;
                for (int j = 0; j < NC; j++) {
                    t += ND_x(v)[j];
                    sum[j] += ND_x(v)[j];
                }
                if (t > 0.0)
                    cnt++;
            }
        }
        if (cnt)
            for (int j = 0; j < NC; j++)
                ND_x(n)[j] = sum[j] / cnt;
    }
 
    /* apply saturation adjustment and convert color to string */
    for (size_t i = 0; i < LIST_SIZE(&nlist); i++) {
        double h, s, b, t;
        char buf[64];
 
        Agnode_t *const n = LIST_GET(&nlist, i);
 
        t = 0.0;
        for (int j = 0; j < NC; j++)
            t += ND_x(n)[j];
        if (t > 0.0) {
            h = ND_x(n)[0];
            if (AdjustSaturation) {
                s = ND_relrank(n) / maxrank;
                if (!Forward)
                    s = 1.0 - s;
                s = MinRankSaturation
                    + s * (MaxRankSaturation - MinRankSaturation);
            } else
                s = 1.0;
            s *= ND_x(n)[1];
            b = ND_x(n)[2];
        } else {
            h = Defcolor[0];
            s = Defcolor[1];
            b = Defcolor[2];
        }
        snprintf(buf, sizeof(buf), "%f %f %f", h, s, b);
        agset(n, "color", buf);
    }
    LIST_FREE(&nlist);
}
 
int main(int argc, char **argv)
{
    Agraph_t *g;
    ingraph_state ig;
 
    init(argc, argv);
    newIngraph(&ig, Files);
 
    while ((g = nextGraph(&ig)) != 0) {
        color(g);
        agwrite(g, stdout);
        fflush(stdout);
        agclose(g);
    }
 
    graphviz_exit(0);
}