Zoltan2_AlgSpectral.hpp

Go to the documentation of this file.

// @HEADER
// *****************************************************************************
//   Zoltan2: A package of combinatorial algorithms for scientific computing
//
// Copyright 2012 NTESS and the Zoltan2 contributors.
// SPDX-License-Identifier: BSD-3-Clause
// *****************************************************************************
// @HEADER
 
#ifndef _ZOLTAN2_ALGSPECTRAL_HPP_
#define _ZOLTAN2_ALGSPECTRAL_HPP_
 
#include <Zoltan2_Algorithm.hpp>
#include <Zoltan2_GraphModel.hpp>
#include <Zoltan2_OrderingSolution.hpp>
 

 
 
namespace Zoltan2{
 
template <typename Adapter>
int AlgSpectral(
  const RCP<GraphModel<Adapter> > &model, 
  //const RCP<Adapter> &matrixadapter, // Hack: Use matrix adapter directly
 
  // TO DO - update this algorithm to have the proper formatting like
  // the others.
  const RCP<LocalOrderingSolution<typename Adapter::lno_t> >
    &solution,
  const RCP<Teuchos::ParameterList> &pl,
  const RCP<const Teuchos::Comm<int> > &comm
) 
{
#ifndef INCLUDE_ZOLTAN2_EXPERIMENTAL
 
  Z2_THROW_EXPERIMENTAL("Zoltan2 Spectral ordering is strictly "
                        "experimental software "
                        "while it is being developed and tested.")
 
#else //INCLUDE_ZOLTAN2_EXPERIMENTAL
 
  typedef typename Adapter::lno_t lno_t;
  typedef typename Adapter::gno_t gno_t;
  typedef typename Adapter::offset_t offset_t;
  typedef typename Adapter::scalar_t scalar_t;
 
  int ierr= 0;
 
  HELLO;
 
// TODO: Check params to do local or global ordering.
  bool localOrder = true;
 
  const size_t nVtx = model->getLocalNumVertices();
  lno_t *perm = solution->getPermutationView();
  for (lno_t i=0; i<nVtx; i++){
    perm[i] = -1;
  }
 
  // Get local graph.
  ArrayView<const gno_t> edgeIds;
  ArrayView<const offset_t> offsets;
  ArrayView<StridedData<lno_t, scalar_t> > wgts;
 
  model->getEdgeList(edgeIds, offsets, wgts);
 
  //cout << "Debug: Local graph from getLocalEdgeList" << endl;
  //cout << "edgeIds: " << edgeIds << endl;
  //cout << "offsets: " << offsets << endl;
 
  // Form the graph Laplacian: L = D-A
  // Create a new Tpetra matrix, but use views of existing data when possible.
  // TODO
 
  // TODO: Find smallest eigenvalues using Anasazi
 
  // TODO: Sort Fiedler vector.
 
  solution->setHavePerm(true);
  return ierr;
#endif // INCLUDE_ZOLTAN2_EXPERIMENTAL
}
 
}
#endif