![]() |
Google OR-Tools v9.15
a fast and portable software suite for combinatorial optimization
|
#include <sparse.h>
Public Member Functions | |
| SparseMatrix () | |
| SparseMatrix (std::initializer_list< std::initializer_list< Fractional > > init_list) | |
| SparseMatrix (const SparseMatrix &)=delete | |
| SparseMatrix & | operator= (const SparseMatrix &)=delete |
| void | Clear () |
| bool | IsEmpty () const |
| void | CleanUp () |
| bool | CheckNoDuplicates () const |
| bool | IsCleanedUp () const |
| void | SetNumRows (RowIndex num_rows) |
| ColIndex | AppendEmptyColumn () |
| void | AppendUnitVector (RowIndex row, Fractional value) |
| void | Swap (SparseMatrix *matrix) |
| void | PopulateFromZero (RowIndex num_rows, ColIndex num_cols) |
| void | PopulateFromIdentity (ColIndex num_cols) |
| template<typename Matrix> | |
| void | PopulateFromTranspose (const Matrix &input) |
| void | PopulateFromSparseMatrix (const SparseMatrix &matrix) |
| template<typename Matrix> | |
| void | PopulateFromPermutedMatrix (const Matrix &a, const RowPermutation &row_perm, const ColumnPermutation &inverse_col_perm) |
| void | PopulateFromLinearCombination (Fractional alpha, const SparseMatrix &a, Fractional beta, const SparseMatrix &b) |
| void | PopulateFromProduct (const SparseMatrix &a, const SparseMatrix &b) |
| void | DeleteColumns (const DenseBooleanRow &columns_to_delete) |
| void | DeleteRows (RowIndex num_rows, const RowPermutation &permutation) |
| bool | AppendRowsFromSparseMatrix (const SparseMatrix &matrix) |
| void | ApplyRowPermutation (const RowPermutation &row_perm) |
| Fractional | LookUpValue (RowIndex row, ColIndex col) const |
| bool | Equals (const SparseMatrix &a, Fractional tolerance) const |
| void | ComputeMinAndMaxMagnitudes (Fractional *min_magnitude, Fractional *max_magnitude) const |
| RowIndex | num_rows () const |
| ColIndex | num_cols () const |
| const SparseColumn & | column (ColIndex col) const |
| SparseColumn * | mutable_column (ColIndex col) |
| EntryIndex | num_entries () const |
| Fractional | ComputeOneNorm () const |
| Fractional | ComputeInfinityNorm () const |
| std::string | Dump () const |
| operations_research::glop::SparseMatrix::SparseMatrix | ( | std::initializer_list< std::initializer_list< Fractional > > | init_list | ) |
|
delete |
| bool operations_research::glop::SparseMatrix::AppendRowsFromSparseMatrix | ( | const SparseMatrix & | matrix | ) |
| void operations_research::glop::SparseMatrix::AppendUnitVector | ( | RowIndex | row, |
| Fractional | value ) |
| void operations_research::glop::SparseMatrix::ApplyRowPermutation | ( | const RowPermutation & | row_perm | ) |
| bool operations_research::glop::SparseMatrix::CheckNoDuplicates | ( | ) | const |
|
inline |
| void operations_research::glop::SparseMatrix::ComputeMinAndMaxMagnitudes | ( | Fractional * | min_magnitude, |
| Fractional * | max_magnitude ) const |
| void operations_research::glop::SparseMatrix::DeleteColumns | ( | const DenseBooleanRow & | columns_to_delete | ) |
| void operations_research::glop::SparseMatrix::DeleteRows | ( | RowIndex | num_rows, |
| const RowPermutation & | permutation ) |
| std::string operations_research::glop::SparseMatrix::Dump | ( | ) | const |
| bool operations_research::glop::SparseMatrix::Equals | ( | const SparseMatrix & | a, |
| Fractional | tolerance ) const |
| bool operations_research::glop::SparseMatrix::IsCleanedUp | ( | ) | const |
| bool operations_research::glop::SparseMatrix::IsEmpty | ( | ) | const |
| Fractional operations_research::glop::SparseMatrix::LookUpValue | ( | RowIndex | row, |
| ColIndex | col ) const |
|
inline |
|
inline |
| EntryIndex operations_research::glop::SparseMatrix::num_entries | ( | ) | const |
|
inline |
|
delete |
| void operations_research::glop::SparseMatrix::PopulateFromIdentity | ( | ColIndex | num_cols | ) |
| void operations_research::glop::SparseMatrix::PopulateFromLinearCombination | ( | Fractional | alpha, |
| const SparseMatrix & | a, | ||
| Fractional | beta, | ||
| const SparseMatrix & | b ) |
| template void operations_research::glop::SparseMatrix::PopulateFromPermutedMatrix< CompactSparseMatrixView > | ( | const Matrix & | a, |
| const RowPermutation & | row_perm, | ||
| const ColumnPermutation & | inverse_col_perm ) |
| void operations_research::glop::SparseMatrix::PopulateFromProduct | ( | const SparseMatrix & | a, |
| const SparseMatrix & | b ) |
| void operations_research::glop::SparseMatrix::PopulateFromSparseMatrix | ( | const SparseMatrix & | matrix | ) |
| template void operations_research::glop::SparseMatrix::PopulateFromTranspose< SparseMatrix > | ( | const Matrix & | input | ) |
| void operations_research::glop::SparseMatrix::PopulateFromZero | ( | RowIndex | num_rows, |
| ColIndex | num_cols ) |
| void operations_research::glop::SparseMatrix::SetNumRows | ( | RowIndex | num_rows | ) |
| void operations_research::glop::SparseMatrix::Swap | ( | SparseMatrix * | matrix | ) |