#endif
#include "cgraph.h"
-#include "memory.h"
#include "arith.h"
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <assert.h>
#include "mmio.h"
+#include "agxbuf.h"
#include "SparseMatrix.h"
#include "matrix_market.h"
#ifdef HAVE_GETOPT_H
#define FREE free
#define test_flag(a, flag) ((a)&(flag))
#define real double
+#define NEW(t) (t*)MALLOC(sizeof(t))
+#define N_NEW(n,t) (t*)MALLOC((n)*sizeof(t))
+#define BUFS 1024
+
typedef struct {
Agrec_t h;
#define ND_id(n) (((Agnodeinfo_t*)(n->base.data))->id)
-static char* cmd;
+static char *cmd;
-static real distance(real *x, int dim, int i, int j){
- int k;
- real dist = 0.;
- for (k = 0; k < dim; k++) dist += (x[i*dim+k] - x[j*dim + k])*(x[i*dim+k] - x[j*dim + k]);
- dist = sqrt(dist);
- return dist;
+static real distance(real * x, int dim, int i, int j)
+{
+ int k;
+ real dist = 0.;
+ for (k = 0; k < dim; k++)
+ dist +=
+ (x[i * dim + k] - x[j * dim + k]) * (x[i * dim + k] -
+ x[j * dim + k]);
+ dist = sqrt(dist);
+ return dist;
}
-static real Hue2RGB(real v1, real v2, real H) {
- if(H < 0.0) H += 1.0;
- if(H > 1.0) H -= 1.0;
- if((6.0*H) < 1.0) return (v1 + (v2 - v1) * 6.0 * H);
- if((2.0*H) < 1.0) return v2;
- if((3.0*H) < 2.0) return (v1 + (v2 - v1) * ((2.0/3.0) - H) * 6.0);
- return v1;
+static real Hue2RGB(real v1, real v2, real H)
+{
+ if (H < 0.0)
+ H += 1.0;
+ if (H > 1.0)
+ H -= 1.0;
+ if ((6.0 * H) < 1.0)
+ return (v1 + (v2 - v1) * 6.0 * H);
+ if ((2.0 * H) < 1.0)
+ return v2;
+ if ((3.0 * H) < 2.0)
+ return (v1 + (v2 - v1) * ((2.0 / 3.0) - H) * 6.0);
+ return v1;
}
-char *hex[16]={"0","1","2","3","4","5","6","7","8","9","a","b","c","d","e","f"};
-
-static char * hue2rgb(real hue, char *color){
- real v1, v2, lightness = .5, saturation = 1;
- int red, blue, green;
-
- if(lightness < 0.5)
- v2 = lightness * (1.0 + saturation);
- else
- v2 = (lightness + saturation) - (saturation * lightness);
-
- v1 = 2.0 * lightness - v2;
-
- red = (int)(255.0 * Hue2RGB(v1, v2, hue + (1.0/3.0)) + 0.5);
- green = (int)(255.0 * Hue2RGB(v1, v2, hue) + 0.5);
- blue = (int)(255.0 * Hue2RGB(v1, v2, hue - (1.0/3.0)) + 0.5);
- color[0] = '#';
- sprintf(color+1,"%s",hex[red/16]);
- sprintf(color+2,"%s",hex[red%16]);
- sprintf(color+3,"%s",hex[green/16]);
- sprintf(color+4,"%s",hex[green%16]);
- sprintf(color+5,"%s",hex[blue/16]);
- sprintf(color+6,"%s",hex[blue%16]);
- color[7] = '\0';
- return color;
+char *hex[16] =
+ { "0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "a", "b", "c", "d",
+"e", "f" };
+
+static char *hue2rgb(real hue, char *color)
+{
+ real v1, v2, lightness = .5, saturation = 1;
+ int red, blue, green;
+
+ if (lightness < 0.5)
+ v2 = lightness * (1.0 + saturation);
+ else
+ v2 = (lightness + saturation) - (saturation * lightness);
+
+ v1 = 2.0 * lightness - v2;
+
+ red = (int) (255.0 * Hue2RGB(v1, v2, hue + (1.0 / 3.0)) + 0.5);
+ green = (int) (255.0 * Hue2RGB(v1, v2, hue) + 0.5);
+ blue = (int) (255.0 * Hue2RGB(v1, v2, hue - (1.0 / 3.0)) + 0.5);
+ color[0] = '#';
+ sprintf(color + 1, "%s", hex[red / 16]);
+ sprintf(color + 2, "%s", hex[red % 16]);
+ sprintf(color + 3, "%s", hex[green / 16]);
+ sprintf(color + 4, "%s", hex[green % 16]);
+ sprintf(color + 5, "%s", hex[blue / 16]);
+ sprintf(color + 6, "%s", hex[blue % 16]);
+ color[7] = '\0';
+ return color;
}
#if 0
-static void
-posStr (char* buf, int dim, real* x, double sc)
+static void posStr(char *buf, int dim, real * x, double sc)
{
- if (dim== 3){
- sprintf (buf, "%f,%f,%f", sc*x[0], sc*x[1], sc*x[2]);
- } else {
- sprintf (buf, "%f,%f", sc*x[0], sc*x[1]);
- }
+ if (dim == 3) {
+ sprintf(buf, "%f,%f,%f", sc * x[0], sc * x[1], sc * x[2]);
+ } else {
+ sprintf(buf, "%f,%f", sc * x[0], sc * x[1]);
+ }
}
-static void
-attach_embedding (Agraph_t* g, int dim, double sc, real *x)
+static void attach_embedding(Agraph_t * g, int dim, double sc, real * x)
{
- Agsym_t* sym = agattr (g, AGNODE, "pos", 0);
- Agnode_t* n;
- char buf[1024];
- int i = 0;
-
- if (!sym)
- sym = agattr (g, AGNODE, "pos", "");
-
- for (n = agfstnode (g); n; n = agnxtnode (g, n)) {
- assert (i == ND_id(n));
- posStr (buf, dim, x + i*dim, sc);
- agxset (n, sym, buf);
- i++;
- }
-
+ Agsym_t *sym = agattr(g, AGNODE, "pos", 0);
+ Agnode_t *n;
+ char buf[BUFS];
+ int i = 0;
+
+ if (!sym)
+ sym = agattr(g, AGNODE, "pos", "");
+
+ for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
+ assert(i == ND_id(n));
+ posStr(buf, dim, x + i * dim, sc);
+ agxset(n, sym, buf);
+ i++;
+ }
+
}
/* SparseMatrix_import_dot:
* Assumes g is connected and simple, i.e., we can have a->b and b->a
* but not a->b and a->b
*/
-SparseMatrix
-SparseMatrix_import_dot (Agraph_t* g, int dim, real **label_sizes, real **x, int format)
+SparseMatrix
+SparseMatrix_import_dot(Agraph_t * g, int dim, real ** label_sizes,
+ real ** x, int format)
{
- SparseMatrix A = 0;
- Agnode_t* n;
- Agedge_t* e;
- Agsym_t* sym;
- int nnodes;
- int nedges;
- int i, row;
- int* I;
- int* J;
- real* val;
- real v;
- int type = MATRIX_TYPE_REAL;
- real padding = 10;
-
- if (!g) return NULL;
- nnodes = agnnodes (g);
- nedges = agnedges (g);
- if (format != FORMAT_CSR) {
- fprintf (stderr, "Format %d not supported\n", format);
- exit (1);
- }
-
- /* Assign node ids */
- i = 0;
- for (n = agfstnode (g); n; n = agnxtnode (g, n))
- ND_id(n) = i++;
-
- I = N_NEW(nedges, int);
- J = N_NEW(nedges, int);
- val = N_NEW(nedges, real);
-
- sym = agndattr(g->proto->e, "wt");
- i = 0;
- for (n = agfstnode (g); n; n = agnxtnode (g, n)) {
- row = ND_id(n);
- for (e = agfstout (g, n); e; e = agnxtout (g, e)) {
- I[i] = row;
- J[i] = ND_id(e->head);
- if (sym) {
- if (sscanf (agxget (e, sym->index), "%lf", &v) != 1)
- v = 1;
- }
- else
- v = 1;
- val[i] = v;
- i++;
+ SparseMatrix A = 0;
+ Agnode_t *n;
+ Agedge_t *e;
+ Agsym_t *sym;
+ int nnodes;
+ int nedges;
+ int i, row;
+ int *I;
+ int *J;
+ real *val;
+ real v;
+ int type = MATRIX_TYPE_REAL;
+ real padding = 10;
+
+ if (!g)
+ return NULL;
+ nnodes = agnnodes(g);
+ nedges = agnedges(g);
+ if (format != FORMAT_CSR) {
+ fprintf(stderr, "Format %d not supported\n", format);
+ exit(1);
}
- }
-
- *label_sizes = MALLOC(sizeof(real)*2*nnodes);
- for (n = agfstnode (g); n; n = agnxtnode (g, n)) {
- real sz;
- i = ND_id(n);
- if (agget(n, "width") && agget(n, "height")){
- sscanf(agget(n, "width"), "%lf", &sz);
- /* (*label_sizes)[i*2] = POINTS(sz)*.6;*/
- (*label_sizes)[i*2] = POINTS(sz)*.5 + padding*0.5;
- sscanf(agget(n, "height"), "%lf", &sz);
- /*(*label_sizes)[i*2+1] = POINTS(sz)*.6;*/
- (*label_sizes)[i*2+1] = POINTS(sz)*.5 + padding*0.5;
- } else {
- (*label_sizes)[i*2] = 4*POINTS(0.75)*.5;
- (*label_sizes)[i*2+1] = 4*POINTS(0.5)*.5;
+
+ /* Assign node ids */
+ i = 0;
+ for (n = agfstnode(g); n; n = agnxtnode(g, n))
+ ND_id(n) = i++;
+
+ I = N_NEW(nedges, int);
+ J = N_NEW(nedges, int);
+ val = N_NEW(nedges, real);
+
+ sym = agndattr(g->proto->e, "wt");
+ i = 0;
+ for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
+ row = ND_id(n);
+ for (e = agfstout(g, n); e; e = agnxtout(g, e)) {
+ I[i] = row;
+ J[i] = ND_id(e->head);
+ if (sym) {
+ if (sscanf(agxget(e, sym->index), "%lf", &v) != 1)
+ v = 1;
+ } else
+ v = 1;
+ val[i] = v;
+ i++;
+ }
}
- }
-
- if (x){
- *x = MALLOC(sizeof(real)*dim*nnodes);
- for (n = agfstnode (g); n; n = agnxtnode (g, n)) {
- real xx,yy;
- i = ND_id(n);
- if (agget(n, "pos")){
- sscanf(agget(n, "pos"), "%lf,%lf", &xx, &yy);
- (*x)[i*dim] = xx;
- (*x)[i*dim+1] = yy;
- } else {
- (*x)[i*dim] = 0;
- (*x)[i*dim+1] = 0;
- }
+
+ *label_sizes = N_NEW(2 * nnodes, real);
+ for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
+ real sz;
+ i = ND_id(n);
+ if (agget(n, "width") && agget(n, "height")) {
+ sscanf(agget(n, "width"), "%lf", &sz);
+ /* (*label_sizes)[i*2] = POINTS(sz)*.6; */
+ (*label_sizes)[i * 2] = POINTS(sz) * .5 + padding * 0.5;
+ sscanf(agget(n, "height"), "%lf", &sz);
+ /*(*label_sizes)[i*2+1] = POINTS(sz)*.6; */
+ (*label_sizes)[i * 2 + 1] = POINTS(sz) * .5 + padding * 0.5;
+ } else {
+ (*label_sizes)[i * 2] = 4 * POINTS(0.75) * .5;
+ (*label_sizes)[i * 2 + 1] = 4 * POINTS(0.5) * .5;
+ }
+ }
+
+ if (x) {
+ *x = N_NEW(dim * nnodes, real);
+ for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
+ real xx, yy;
+ i = ND_id(n);
+ if (agget(n, "pos")) {
+ sscanf(agget(n, "pos"), "%lf,%lf", &xx, &yy);
+ (*x)[i * dim] = xx;
+ (*x)[i * dim + 1] = yy;
+ } else {
+ (*x)[i * dim] = 0;
+ (*x)[i * dim + 1] = 0;
+ }
+ }
}
- }
- A = SparseMatrix_from_coordinate_arrays(nedges, nnodes, nnodes, I, J, val, type);
+ A = SparseMatrix_from_coordinate_arrays(nedges, nnodes, nnodes, I, J,
+ val, type);
- FREE(I);
- FREE(J);
- FREE(val);
+ FREE(I);
+ FREE(J);
+ FREE(val);
- return A;
+ return A;
}
#endif
-static char *strip_dir(char *s){
- int i, first = TRUE;
- for (i = strlen(s); i >= 0; i--) {
- if (first && s[i] == '.') {/* get rid of .mtx */
- s[i] = '\0';
- first = FALSE;
+static char *strip_dir(char *s)
+{
+ int i, first = TRUE;
+ for (i = strlen(s); i >= 0; i--) {
+ if (first && s[i] == '.') { /* get rid of .mtx */
+ s[i] = '\0';
+ first = FALSE;
+ }
+ if (s[i] == '/')
+ return (char *) &(s[i + 1]);
}
- if (s[i] == '/') return (char*) &(s[i+1]);
- }
- return s;
+ return s;
}
-static Agraph_t*
-makeDotGraph (SparseMatrix A, char *name, int dim, real *x, int with_color, int with_label)
+static Agraph_t *makeDotGraph(SparseMatrix A, char *name, int dim,
+ real * x, int with_color, int with_label, int with_val)
{
- Agraph_t* g;
- Agnode_t* n;
- Agnode_t* h;
- Agedge_t* e;
- int i, j;
- char buf[1024], buf2[1024];
- Agsym_t *sym, *sym2 = NULL, *sym3 = NULL;
- int* ia=A->ia;
- int* ja=A->ja;
- real* val = (real*)(A->a);
- Agnode_t** arr = N_NEW (A->m, Agnode_t*);
- real *color = NULL;
- char cstring[8];
- char *label_string;
-
- name = strip_dir(name);
-
- label_string = MALLOC(sizeof(char)*1000);
- if (SparseMatrix_known_undirected(A)){
- g = agopen ("G", Agundirected, (Agdisc_t *) 0);
- } else {
- g = agopen ("G", Agdirected, (Agdisc_t *) 0);
- }
- sprintf (buf, "%f", 1.0);
-
- label_string = strcpy(label_string, name);
- label_string = strcat(label_string, ". ");
- sprintf (buf, "%d", A->m);
- label_string = strcat(label_string, buf);
- label_string = strcat(label_string, " nodes, ");
- sprintf (buf, "%d", A->nz);
- label_string = strcat(label_string, buf);
- label_string = strcat(label_string, " edges.");
-
- if (with_label) sym = agattr(g, AGRAPH, "label", label_string);
- if (with_color) sym = agattr(g, AGRAPH, "bgcolor", "black");
-
- if (with_color) {
- sym2 = agattr(g, AGEDGE, "color", "");
- sym3 = agattr(g, AGEDGE, "wt", "");
- }
- for (i = 0; i < A->m; i++) {
- sprintf (buf, "%d", i);
- n = agnode (g, buf, 1);
- agbindrec (n, "nodeinfo", sizeof(Agnodeinfo_t), TRUE);
- ND_id(n) = i;
- arr[i] = n;
- }
-
- if (with_color){
- real maxdist = 0.;
- real mindist = 0.;
- int first = TRUE;
- color = malloc(sizeof(real)*A->nz);
- for (n = agfstnode (g); n; n = agnxtnode (g, n)) {
- i = ND_id(n);
- if (A->type != MATRIX_TYPE_REAL){
- for (j = ia[i]; j < ia[i+1]; j++) {
- color[j] = distance(x, dim, i, ja[j]);
- if (i != ja[j]){
- if (first){
- mindist = color[j];
- first = FALSE;
+ Agraph_t *g;
+ Agnode_t *n;
+ Agnode_t *h;
+ Agedge_t *e;
+ int i, j;
+ agxbuf xb;
+ char buf[BUFS];
+ unsigned char string[BUFS];
+ Agsym_t *sym, *sym2 = NULL, *sym3 = NULL;
+ int *ia = A->ia;
+ int *ja = A->ja;
+ real *val = (real *) (A->a);
+ Agnode_t **arr = N_NEW(A->m, Agnode_t *);
+ real *color = NULL;
+ char cstring[8];
+
+ name = strip_dir(name);
+
+ if (with_color) {
+ if ((A->type == MATRIX_TYPE_REAL) && !val) {
+ fprintf (stderr, "Warning: input matrix has no values, -c flag ignored\n");
+ with_color = 0;
+ }
+ else if ((A->type != MATRIX_TYPE_REAL) && !x) {
+ fprintf (stderr, "Warning: input has no coordinates, -c flag ignored\n");
+ with_color = 0;
+ }
+ }
+
+ if (SparseMatrix_known_undirected(A)) {
+ g = agopen("G", Agundirected, (Agdisc_t *) 0);
+ } else {
+ g = agopen("G", Agdirected, (Agdisc_t *) 0);
+ }
+
+ if (with_val) {
+ sym = agattr(g, AGEDGE, "len", "1");
+ }
+ agxbinit (&xb, BUFS, string);
+ if (with_label) {
+ agxbput (&xb, name);
+ agxbput (&xb, ". ");
+ sprintf(buf, "%d", A->m);
+ agxbput (&xb, buf);
+ agxbput (&xb, " nodes, ");
+ sprintf(buf, "%d", A->nz);
+ agxbput (&xb, buf);
+ agxbput (&xb, " edges.");
+ agattr(g, AGRAPH, "label", agxbuse (&xb));
+ }
+
+ for (i = 0; i < A->m; i++) {
+ sprintf(buf, "%d", i);
+ n = agnode(g, buf, 1);
+ agbindrec(n, "nodeinfo", sizeof(Agnodeinfo_t), TRUE);
+ ND_id(n) = i;
+ arr[i] = n;
+ }
+
+ if (with_color) {
+ real maxdist = 0.;
+ real mindist = 0.;
+ int first = TRUE;
+
+ sym2 = agattr(g, AGEDGE, "color", "");
+ sym3 = agattr(g, AGEDGE, "wt", "");
+ agattr(g, AGRAPH, "bgcolor", "black");
+ color = N_NEW(A->nz, real);
+ for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
+ i = ND_id(n);
+ if (A->type != MATRIX_TYPE_REAL) {
+ for (j = ia[i]; j < ia[i + 1]; j++) {
+ color[j] = distance(x, dim, i, ja[j]);
+ if (i != ja[j]) {
+ if (first) {
+ mindist = color[j];
+ first = FALSE;
+ } else {
+ mindist = MIN(mindist, color[j]);
+ }
+ }
+ maxdist = MAX(color[j], maxdist);
+ }
} else {
- mindist = MIN(mindist, color[j]);
+ for (j = ia[i]; j < ia[i + 1]; j++) {
+ if (val) color[j] = ABS(val[j]);
+ else color[j] = 1;
+ if (i != ja[j]) {
+ if (first) {
+ mindist = color[j];
+ first = FALSE;
+ } else {
+ mindist = MIN(mindist, color[j]);
+ }
+ }
+ maxdist = MAX(color[j], maxdist);
+ }
}
- }
- maxdist = MAX(color[j], maxdist);
}
- } else {
- for (j = ia[i]; j < ia[i+1]; j++) {
- color[j] = ABS(val[j]);
- if (i != ja[j]){
- if (first){
- mindist = color[j];
- first = FALSE;
- } else {
- mindist = MIN(mindist, color[j]);
+ for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
+ i = ND_id(n);
+ for (j = ia[i]; j < ia[i + 1]; j++) {
+ color[j] =
+ ((color[j] - mindist) / MAX(maxdist - mindist,
+ 0.000001));
}
- }
- maxdist = MAX(color[j], maxdist);
}
- }
}
- for (n = agfstnode (g); n; n = agnxtnode (g, n)) {
- i = ND_id(n);
- for (j = ia[i]; j < ia[i+1]; j++) {
- color[j] = ((color[j] - mindist)/MAX(maxdist-mindist, 0.000001));
- }
- }
- }
-
- i = 0;
- for (n = agfstnode (g); n; n = agnxtnode (g, n)) {
- i = ND_id(n);
- for (j = ia[i]; j < ia[i+1]; j++) {
- h = arr [ja[j]];
- if (val){
- sprintf (buf, "%f", val[j]);
- if (with_color) sprintf (buf2, hue2rgb(.65*color[j], cstring));
- } else {
- sprintf (buf, "%f", 1.);
- if (with_color) sprintf (buf2, hue2rgb(.65*color[j], cstring));
- }
- e = agedge (g, n, h, NULL, 1);
- if (with_color) {
- agxset (e, sym2, buf2);
- sprintf (buf2, "%f", color[j]);
- agxset (e, sym3, buf2);
- }
+
+ i = 0;
+ for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
+ i = ND_id(n);
+ for (j = ia[i]; j < ia[i + 1]; j++) {
+ h = arr[ja[j]];
+ e = agedge(g, n, h, NULL, 1);
+ if (with_val && val) {
+ sprintf(buf, "%f", val[j]);
+ agxset(e, sym, buf);
+ }
+ if (with_color) {
+ agxset (e, sym2, hue2rgb(.65 * color[j], cstring));
+ sprintf(buf, "%f", color[j]);
+ agxset(e, sym3, buf);
+ }
+ }
}
- }
-
- FREE(color);
- FREE (arr);
- FREE(label_string);
- return g;
+
+ agxbfree (&xb);
+ FREE(color);
+ FREE(arr);
+ return g;
}
-static void usage (int eval)
+static char* useString = "Usage: %s [-uvcl] [-o file] matrix_market_filename\n\
+ -u - make graph undirected\n\
+ -v - assign len to edges\n\
+ -c - assign color and wt to edges\n\
+ -l - add label\n\
+ -o <file> - output file \n";
+
+static void usage(int eval)
{
- fprintf(stderr, "Usage: %s [-u] [-o file] matrix_market_filename.\n", cmd);
+ fprintf(stderr, useString, cmd);
exit(eval);
}
-static FILE* openF (char* fname, char* mode)
+static FILE *openF(char *fname, char *mode)
{
- FILE* f = fopen (fname, mode);
+ FILE *f = fopen(fname, mode);
if (!f) {
- fprintf (stderr, "Could not open %s for %s\n", fname,
- ((*mode == 'r') ? "reading" : "writing"));
- exit (1);
+ fprintf(stderr, "Could not open %s for %s\n", fname,
+ ((*mode == 'r') ? "reading" : "writing"));
+ exit(1);
}
return f;
}
-
+
typedef struct {
- FILE* inf;
- FILE* outf;
- char* infile;
+ FILE *inf;
+ FILE *outf;
+ char *infile;
int undirected;
+ int with_label;
+ int with_color;
+ int with_val;
} parms_t;
-static void init(int argc, char **argv, parms_t* p)
+static void init(int argc, char **argv, parms_t * p)
{
int c;
cmd = argv[0];
opterr = 0;
- while ((c = getopt(argc, argv, ":o:u")) != -1) {
+ while ((c = getopt(argc, argv, ":o:uvcl")) != -1) {
switch (c) {
case 'o':
- p->outf = openF (optarg, "w");
+ p->outf = openF(optarg, "w");
+ break;
+ case 'l':
+ p->with_label = 1;
break;
case 'u':
p->undirected = 1;
break;
+ case 'v':
+ p->with_val = 1;
+ break;
+ case 'c':
+ p->with_color = 1;
+ break;
case '?':
if (optopt == '?')
usage(0);
else
fprintf(stderr,
- "%s: option -%c unrecognized - ignored\n", cmd, optopt);
+ "%s: option -%c unrecognized - ignored\n", cmd,
+ optopt);
break;
}
}
if (argc) {
p->infile = argv[0];
- p->inf = openF (argv[0], "r");
+ p->inf = openF(argv[0], "r");
}
}
int main(int argc, char *argv[])
{
- Agraph_t* g = 0;
- SparseMatrix A = NULL;
- int dim;
- parms_t pv;
+ Agraph_t *g = 0;
+ SparseMatrix A = NULL;
+ int dim;
+ parms_t pv;
/* ======================= set parameters ==================== */
pv.inf = stdin;
pv.outf = stdout;
pv.infile = "stdin";
pv.undirected = 0;
+ pv.with_label = 0;
+ pv.with_color = 0;
+ pv.with_val = 0;
init(argc, argv, &pv);
- /* ======================= read graph ==================== */
+ /* ======================= read graph ==================== */
+
+ A = SparseMatrix_import_matrix_market(pv.inf, FORMAT_CSR);
+ if (!A) {
+ usage(1);
+ }
- A = SparseMatrix_import_matrix_market(pv.inf, FORMAT_CSR);
- if (!A) {
- usage(1);
- }
+ A = SparseMatrix_to_square_matrix(A);
- A = SparseMatrix_to_square_matrix(A);
+ if (!A) {
+ fprintf(stderr, "cannot import from file %s\n", pv.infile);
+ exit(1);
+ }
- if (!A){
- fprintf(stderr,"cannot import from file %s\n",pv.infile);
- exit(1);
- }
+ if (pv.undirected) {
+ SparseMatrix B;
+ B = SparseMatrix_make_undirected(A);
+ SparseMatrix_delete(A);
+ A = B;
+ }
+ g = makeDotGraph(A, pv.infile, dim, NULL, pv.with_color, pv.with_label, pv.with_val);
- if (pv.undirected) {
- SparseMatrix B;
- B = SparseMatrix_make_undirected(A);
- SparseMatrix_delete(A);
- A = B;
- }
- g = makeDotGraph (A, pv.infile, dim, NULL, FALSE, TRUE);
-
- agwrite (g, pv.outf);
+ agwrite(g, pv.outf);
- return 0;
+ return 0;
}
projects / graphviz / commitdiff