-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmatrix.h
More file actions
63 lines (51 loc) · 2.15 KB
/
matrix.h
File metadata and controls
63 lines (51 loc) · 2.15 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
/*
* This file is part of the GreasePad distribution (https://github.com/FraunhoferIOSB/GreasePad).
* Copyright (c) 2022-2023 Jochen Meidow, Fraunhofer IOSB
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#ifndef MATRIX_H
#define MATRIX_H
#include <Eigen/Sparse>
namespace Graph {
using Eigen::SparseMatrix;
using Eigen::ColMajor;
using Eigen::VectorXi;
// using Eigen::IOFormat;
//! Sparse incidence matrix to encode relationships
class IncidenceMatrix : public SparseMatrix<int, ColMajor, int>
{
public:
//! Copy assignment operator
template<typename OtherDerived>
IncidenceMatrix& operator=( const Eigen::SparseMatrixBase <OtherDerived>& other)
{
this->Eigen::SparseMatrix<int, ColMajor,int>::operator=(other);
return *this;
}
VectorXi findInColumn( int c ) const; //!< Matlab: find(A(:,c))
bool isSet( Index r, Index c) const; //!< Check if r and c are related
SparseMatrix<int> biadjacency() const; //!< Create biadjacency matrix [O, A; A', O]
void set( Index r, Index c) { coeffRef(r,c) = 1; } //!< Set relation (row r, column c)
void unset( Index r, Index c) { coeffRef(r,c) = 0; } //!< Delete relation (row r, column c)
void remove_row( int r ); //!< Remove r-th row
void remove_column( int c ); //!< Remove c-th column
void reduce( int i); //!< Remove i-th column and i-th row
//! Augment matrix by one row and one column
void augment() { conservativeResize( rows()+1, cols()+1); }
private:
// static const IOFormat fmt;
};
} // namespace Graph
#endif // MATRIX_H