6 #ifndef ClpNetworkMatrix_H
7 #define ClpNetworkMatrix_H
62 virtual void deleteCols(
const int numDel,
const int * indDel);
64 virtual void deleteRows(
const int numDel,
const int * indDel);
76 const double * element,
int numberOther = -1);
82 const int * whichColumn,
83 int & numberColumnBasic);
86 const int * whichColumn,
87 int & numberColumnBasic,
88 int * row,
int * start,
89 int * rowCount,
int * columnCount,
99 virtual void rangeOfElements(
double & smallestNegative,
double & largestNegative,
100 double & smallestPositive,
double & largestPositive);
115 int column,
double multiplier)
const ;
118 int column,
double multiplier)
const;
125 int & bestSequence,
int & numberWanted);
133 virtual void times(
double scalar,
134 const double * x,
double * y)
const;
136 virtual void times(
double scalar,
137 const double * x,
double * y,
138 const double * rowScale,
139 const double * columnScale)
const;
144 const double * x,
double * y)
const;
147 const double * x,
double * y,
148 const double * rowScale,
149 const double * columnScale,
double * spare = NULL)
const;
200 int numberRows,
const int * whichRows,
201 int numberColumns,
const int * whichColumns);
205 int numberRows,
const int * whichRows,
206 int numberColumns,
const int * whichColumns)
const ;
virtual int getNumCols() const
Number of columns.
virtual CoinBigIndex getNumElements() const
Number of entries in the packed matrix.
virtual const double * getElements() const
A vector containing the elements in the packed matrix.
virtual const int * getIndices() const
A vector containing the minor indices of the elements in the packed matrix.
virtual void releasePackedMatrix() const
Allow any parts of a created CoinMatrix to be deleted.
virtual bool canDoPartialPricing() const
Says whether it can do partial pricing.
virtual const CoinBigIndex * getVectorStarts() const
Return a complete CoinPackedMatrix.
CoinPackedMatrix * matrix_
For fake CoinPackedMatrix.
int numberColumns_
Number of columns.
int * indices_
Data -1, then +1 rows in pairs (row==-1 if one entry)
Sparse Matrix Base Class.
virtual CoinBigIndex countBasis(const int *whichColumn, int &numberColumnBasic)
Returns number of elements in column part of basis.
virtual ~ClpNetworkMatrix()
Destructor.
virtual bool isColOrdered() const
Whether the packed matrix is column major ordered or not.
Abstract base class for various sparse vectors.
virtual void rangeOfElements(double &smallestNegative, double &largestNegative, double &smallestPositive, double &largestPositive)
Returns largest and smallest elements of both signs.
virtual CoinBigIndex * dubiousWeights(const ClpSimplex *model, int *inputWeights) const
Given positive integer weights for each row fills in sum of weights for each column (and slack)...
int type() const
Returns type.
virtual void add(const ClpSimplex *model, CoinIndexedVector *rowArray, int column, double multiplier) const
Adds multiple of a column into an CoinIndexedvector You can use quickAdd to add to vector...
bool trueNetwork() const
Return true if really network, false if has slacks.
This implements a simple network matrix as derived from ClpMatrixBase.
virtual void deleteRows(const int numDel, const int *indDel)
Delete the rows whose indices are listed in indDel.
double CoinFactorizationDouble
virtual ClpMatrixBase * clone() const
Clone.
virtual ClpMatrixBase * reverseOrderedCopy() const
Returns a new matrix in reverse order without gaps.
virtual void transposeTimes(double scalar, const double *x, double *y) const
Return y + x * scalar * A in y.
virtual void deleteCols(const int numDel, const int *indDel)
Delete the columns whose indices are listed in indDel.
virtual ClpMatrixBase * subsetClone(int numberRows, const int *whichRows, int numberColumns, const int *whichColumns) const
Subset clone (without gaps).
virtual void unpackPacked(ClpSimplex *model, CoinIndexedVector *rowArray, int column) const
Unpacks a column into an CoinIndexedvector in packed format Note that model is NOT const...
int numberRows_
Number of rows.
ClpNetworkMatrix()
Default constructor.
ClpNetworkMatrix & operator=(const ClpNetworkMatrix &)
The copy constructor.
int * lengths_
For fake CoinPackedMatrix.
This solves LPs using the simplex method.
virtual const int * getVectorLengths() const
The lengths of the major-dimension vectors.
Abstract base class for Clp Matrices.
virtual void unpack(const ClpSimplex *model, CoinIndexedVector *rowArray, int column) const
Unpacks a column into an CoinIndexedvector.
bool trueNetwork_
True if all entries have two elements.
virtual void subsetTransposeTimes(const ClpSimplex *model, const CoinIndexedVector *x, const CoinIndexedVector *y, CoinIndexedVector *z) const
Return <code>x *A</code> in <code>z</code> but just for indices in y.
virtual void appendCols(int number, const CoinPackedVectorBase *const *columns)
Append Columns.
virtual int getNumRows() const
Number of rows.
virtual void times(double scalar, const double *x, double *y) const
Return y + A * scalar *x in y.
virtual void fillBasis(ClpSimplex *model, const int *whichColumn, int &numberColumnBasic, int *row, int *start, int *rowCount, int *columnCount, CoinFactorizationDouble *element)
Fills in column part of basis.
virtual int appendMatrix(int number, int type, const CoinBigIndex *starts, const int *index, const double *element, int numberOther=-1)
Append a set of rows/columns to the end of the matrix.
virtual void partialPricing(ClpSimplex *model, double start, double end, int &bestSequence, int &numberWanted)
Partial pricing.
virtual void appendRows(int number, const CoinPackedVectorBase *const *rows)
Append Rows.
virtual CoinPackedMatrix * getPackedMatrix() const
Return a complete CoinPackedMatrix.