cudd  3.0.0
The University of Colorado Decision Diagram Package
Functions
cuddRead.c File Reference

Functions to read in a matrix. More...

#include "util.h"
#include "cuddInt.h"
Include dependency graph for cuddRead.c:

Functions

int Cudd_addRead (FILE *fp, DdManager *dd, DdNode **E, DdNode ***x, DdNode ***y, DdNode ***xn, DdNode ***yn_, int *nx, int *ny, int *m, int *n, int bx, int sx, int by, int sy)
 Reads in a sparse matrix. More...
 
int Cudd_bddRead (FILE *fp, DdManager *dd, DdNode **E, DdNode ***x, DdNode ***y, int *nx, int *ny, int *m, int *n, int bx, int sx, int by, int sy)
 Reads in a graph (without labels) given as a list of arcs. More...
 

Detailed Description

Functions to read in a matrix.

See also
cudd_addHarwell.c
Author
Fabio Somenzi

Function Documentation

◆ Cudd_addRead()

int Cudd_addRead ( FILE *  fp,
DdManager dd,
DdNode **  E,
DdNode ***  x,
DdNode ***  y,
DdNode ***  xn,
DdNode ***  yn_,
int *  nx,
int *  ny,
int *  m,
int *  n,
int  bx,
int  sx,
int  by,
int  sy 
)

Reads in a sparse matrix.

Reads in a sparse matrix specified in a simple format. The first line of the input contains the numbers of rows and columns. The remaining lines contain the elements of the matrix, one per line. Given a background value (specified by the background field of the manager), only the values different from it are explicitly listed. Each foreground element is described by two integers, i.e., the row and column number, and a real number, i.e., the value.

Cudd_addRead produces an ADD that depends on two sets of variables: x and y. The x variables (x[0] ... x[nx-1]) encode the row index and the y variables (y[0] ... y[ny-1]) encode the column index. x[0] and y[0] are the most significant bits in the indices. The variables may already exist or may be created by the function. The index of x[i] is bx+i*sx, and the index of y[i] is by+i*sy.

On input, nx and ny hold the numbers of row and column variables already in existence. On output, they hold the numbers of row and column variables actually used by the matrix. When Cudd_addRead creates the variable arrays, the index of x[i] is bx+i*sx, and the index of y[i] is by+i*sy. When some variables already exist Cudd_addRead expects the indices of the existing x variables to be bx+i*sx, and the indices of the existing y variables to be by+i*sy.

m and n are set to the numbers of rows and columns of the matrix. Their values on input are immaterial. The ADD for the sparse matrix is returned in E, and its reference count is > 0.

Returns
1 in case of success; 0 otherwise.
Side effects nx and ny are set to the numbers of row and column
variables. m and n are set to the numbers of rows and columns. x and y are possibly extended to represent the array of row and column variables. Similarly for xn and yn_, which hold on return from Cudd_addRead the complements of the row and column variables.
See also
Cudd_addHarwell Cudd_bddRead
Parameters
fpinput file pointer
ddDD manager
Echaracteristic function of the graph
xarray of row variables
yarray of column variables
xnarray of complemented row variables
yn_array of complemented column variables
nxnumber or row variables
nynumber or column variables
mnumber of rows
nnumber of columns
bxfirst index of row variables
sxstep of row variables
byfirst index of column variables
systep of column variables

◆ Cudd_bddRead()

int Cudd_bddRead ( FILE *  fp,
DdManager dd,
DdNode **  E,
DdNode ***  x,
DdNode ***  y,
int *  nx,
int *  ny,
int *  m,
int *  n,
int  bx,
int  sx,
int  by,
int  sy 
)

Reads in a graph (without labels) given as a list of arcs.

Reads in a graph (without labels) given as an adjacency matrix. The first line of the input contains the numbers of rows and columns of the adjacency matrix. The remaining lines contain the arcs of the graph, one per line. Each arc is described by two integers, i.e., the row and column number, or the indices of the two endpoints. Cudd_bddRead produces a BDD that depends on two sets of variables: x and y. The x variables (x[0] ... x[nx-1]) encode the row index and the y variables (y[0] ... y[ny-1]) encode the column index. x[0] and y[0] are the most significant bits in the indices. The variables may already exist or may be created by the function. The index of x[i] is bx+i*sx, and the index of y[i] is by+i*sy.

On input, nx and ny hold the numbers of row and column variables already in existence. On output, they hold the numbers of row and column variables actually used by the matrix. When Cudd_bddRead creates the variable arrays, the index of x[i] is bx+i*sx, and the index of y[i] is by+i*sy. When some variables already exist, Cudd_bddRead expects the indices of the existing x variables to be bx+i*sx, and the indices of the existing y variables to be by+i*sy.

m and n are set to the numbers of rows and columns of the matrix. Their values on input are immaterial. The BDD for the graph is returned in E, and its reference count is > 0.

Returns
1 in case of success; 0 otherwise.
Side effects nx and ny are set to the numbers of row and column
variables. m and n are set to the numbers of rows and columns. x and y are possibly extended to represent the array of row and column variables.
See also
Cudd_addHarwell Cudd_addRead
Parameters
fpinput file pointer
ddDD manager
Echaracteristic function of the graph
xarray of row variables
yarray of column variables
nxnumber or row variables
nynumber or column variables
mnumber of rows
nnumber of columns
bxfirst index of row variables
sxstep of row variables
byfirst index of column variables
systep of column variables