Implementation of the Gibbs-Poole-Stockmeyer algorithm. Experimental in 1.2.x. More...
#include <iostream>
#include <fstream>
#include <string>
#include <algorithm>
#include <map>
#include <vector>
#include <deque>
#include <cmath>
#include "viennacl/misc/cuthill_mckee.hpp"
Go to the source code of this file.
Data Structures | |
struct | gibbs_poole_stockmeyer_tag |
Namespaces | |
namespace | viennacl |
namespace | viennacl::detail |
Functions | |
int | calc_layering_width (std::vector< std::vector< int > > const &l) |
template<typename MatrixType > | |
std::vector< std::vector< int > > | gps_rg_components (MatrixType const &matrix, int n, std::vector< int > const &rg) |
template<typename MatrixType > | |
std::vector< int > | reorder (MatrixType const &matrix, gibbs_poole_stockmeyer_tag) |
Function for the calculation of a node numbering permutation vector to reduce the bandwidth of a incidence matrix by the Gibbs-Poole-Stockmeyer algorithm. |
Implementation of the Gibbs-Poole-Stockmeyer algorithm. Experimental in 1.2.x.
Contributed by Philipp Grabenweger, interface adjustments by Karl Rupp.