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
64
65
66
|
/*
* Copyright 2008-2009 NVIDIA Corporation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/*! \file maximal_independent_set.h
* \brief Maximal independent set of a graph
*/
#pragma once
#include <cusp/detail/config.h>
namespace cusp
{
namespace graph
{
/*! \addtogroup algorithms Algorithms
* \ingroup algorithms
* \{
*/
/*! \p maximal_independent_set : computes a maximal independent set (MIS)
* a graph. The MIS is a set of vertices such that (1) no two vertices
* are adjacent and (2) it is not possible to add another vertex to thes
* set without violating the first property. The MIS(k) is a generalization
* of the MIS with the property that no two vertices in the set are joined
* by a path of \p k edges or less. The standard MIS is therefore a MIS(1).
*
* The MIS(k) is represented by an array of {0,1} values. Specifically,
* <tt>stencil[i]</tt> is 1 if vertex \p i is a member of the MIS(k) and
* 0 otherwise.
*
* \param A symmetric matrix that represents a graph
* \param stencil array to hold the MIS(k)
* \param k radius of independence
*
* \tparam Matrix matrix
* \tparam Array array
*
* \see http://en.wikipedia.org/wiki/Maximal_independent_set
*/
template <typename Matrix, typename Array>
size_t maximal_independent_set(const Matrix& A, Array& stencil, size_t k = 1);
/*! \}
*/
} // end namespace graph
} // end namespace cusp
#include <cusp/graph/detail/maximal_independent_set.inl>
|
