Zoltan2
Loading...
Searching...
No Matches
Zoltan2_AlgSortedDegree.hpp
Go to the documentation of this file.
1// @HEADER
2//
3// ***********************************************************************
4//
5// Zoltan2: A package of combinatorial algorithms for scientific computing
6// Copyright 2012 Sandia Corporation
7//
8// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
9// the U.S. Government retains certain rights in this software.
10//
11// Redistribution and use in source and binary forms, with or without
12// modification, are permitted provided that the following conditions are
13// met:
14//
15// 1. Redistributions of source code must retain the above copyright
16// notice, this list of conditions and the following disclaimer.
17//
18// 2. Redistributions in binary form must reproduce the above copyright
19// notice, this list of conditions and the following disclaimer in the
20// documentation and/or other materials provided with the distribution.
21//
22// 3. Neither the name of the Corporation nor the names of the
23// contributors may be used to endorse or promote products derived from
24// this software without specific prior written permission.
25//
26// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
27// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
30// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
31// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
32// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
33// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
34// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
35// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
36// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
37//
38// Questions? Contact Karen Devine (kddevin@sandia.gov)
39// Erik Boman (egboman@sandia.gov)
40// Siva Rajamanickam (srajama@sandia.gov)
41//
42// ***********************************************************************
43//
44// @HEADER
45#ifndef _ZOLTAN2_SORTEDDEGREE_HPP_
46#define _ZOLTAN2_SORTEDDEGREE_HPP_
47
48#include <Zoltan2_Algorithm.hpp>
51#include <Zoltan2_Sort.hpp>
52#include <algorithm>
53
54
59
60namespace Zoltan2{
61
62template <typename Adapter>
63class AlgSortedDegree : public Algorithm<Adapter>
64{
65 private:
66
67 const RCP<const typename Adapter::base_adapter_t> adapter;
68 const RCP<Teuchos::ParameterList> pl;
69 const RCP<const Teuchos::Comm<int> > comm;
70 RCP<const Environment> env;
71 modelFlag_t graphFlags;
72
73 public:
74
75 typedef typename Adapter::lno_t lno_t;
76 typedef typename Adapter::gno_t gno_t;
77 typedef typename Adapter::offset_t offset_t;
78 typedef typename Adapter::scalar_t scalar_t;
79
81 const RCP<const typename Adapter::base_adapter_t> &adapter__,
82 const RCP<Teuchos::ParameterList> &pl__,
83 const RCP<const Teuchos::Comm<int> > &comm__,
84 RCP<const Environment> &env__,
85 const modelFlag_t &graphFlags__
86 ) : adapter(adapter__), pl(pl__), comm(comm__), env(env__), graphFlags(graphFlags__)
87 {
88 }
89
90 int globalOrder(const RCP<GlobalOrderingSolution<gno_t> > &/* solution */)
91 {
92 throw std::logic_error(
93 "AlgSortedDegree does not yet support global ordering.");
94 }
95
96 int localOrder(const RCP<LocalOrderingSolution<lno_t> > &solution)
97 {
98 int ierr= 0;
99
100 HELLO;
101
102 lno_t *perm = solution->getPermutationView();
103 if (perm==0){
104 // Throw exception
105 std::cerr << "perm is NULL" << std::endl;
106 ierr = -1;
107 }
108
109 // Get local graph.
110 const auto model = rcp(new GraphModel<Adapter>(adapter, env, comm, graphFlags));
111 const size_t nVtx = model->getLocalNumVertices();
112 ArrayView<const gno_t> edgeIds;
113 ArrayView<const offset_t> offsets;
114 ArrayView<StridedData<lno_t, scalar_t> > wgts;
115 model->getEdgeList(edgeIds, offsets, wgts);
116
117
118 // Store degrees together with index so we can sort.
119 Teuchos::Array<std::pair<lno_t, offset_t> > degrees(nVtx);
120 for (lno_t i=0; i<(lno_t)nVtx; i++){
121 degrees[i].first = i;
122 degrees[i].second = offsets[i+1] - offsets[i];
123 }
124
125 // Sort degrees.
126 SortPairs<lno_t,offset_t> zort;
127 bool inc = true; // TODO: Add user parameter
128 zort.sort(degrees, inc);
129
130 // Copy permuted indices to perm.
131 for (lno_t i=0; i<(lno_t)nVtx; i++){
132 perm[i] = degrees[i].first;
133 }
134
135 solution->setHavePerm(true);
136 return ierr;
137 }
138
139};
140}
141#endif
Defines the GraphModel interface.
Defines the OrderingSolution class.
Sort vector of pairs (key, value) by value.
#define HELLO
AlgSortedDegree(const RCP< const typename Adapter::base_adapter_t > &adapter__, const RCP< Teuchos::ParameterList > &pl__, const RCP< const Teuchos::Comm< int > > &comm__, RCP< const Environment > &env__, const modelFlag_t &graphFlags__)
int globalOrder(const RCP< GlobalOrderingSolution< gno_t > > &)
Ordering method.
int localOrder(const RCP< LocalOrderingSolution< lno_t > > &solution)
Ordering method.
Algorithm defines the base class for all algorithms.
Created by mbenlioglu on Aug 31, 2020.
std::bitset< NUM_MODEL_FLAGS > modelFlag_t