aGrUM
3.2.0
a C++ library for (probabilistic) graphical models
Toggle main menu visibility
edgeGraphPart_tpl.h
Go to the documentation of this file.
1
/****************************************************************************
2
* This file is part of the aGrUM/pyAgrum library. *
3
* *
4
* Copyright (c) 2005-2026 by *
5
* - Pierre-Henri WUILLEMIN(_at_LIP6) *
6
* - Christophe GONZALES(_at_AMU) *
7
* *
8
* The aGrUM/pyAgrum library is free software; you can redistribute it *
9
* and/or modify it under the terms of either : *
10
* *
11
* - the GNU Lesser General Public License as published by *
12
* the Free Software Foundation, either version 3 of the License, *
13
* or (at your option) any later version, *
14
* - the MIT license (MIT), *
15
* - or both in dual license, as here. *
16
* *
17
* (see https://agrum.gitlab.io/articles/dual-licenses-lgplv3mit.html) *
18
* *
19
* This aGrUM/pyAgrum library is distributed in the hope that it will be *
20
* useful, but WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, *
21
* INCLUDING BUT NOT LIMITED TO THE WARRANTIES MERCHANTABILITY or FITNESS *
22
* FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE *
23
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER *
24
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, *
25
* ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR *
26
* OTHER DEALINGS IN THE SOFTWARE. *
27
* *
28
* See LICENCES for more details. *
29
* *
30
* SPDX-FileCopyrightText: Copyright 2005-2026 *
31
* - Pierre-Henri WUILLEMIN(_at_LIP6) *
32
* - Christophe GONZALES(_at_AMU) *
33
* SPDX-License-Identifier: LGPL-3.0-or-later OR MIT *
34
* *
35
* Contact : info_at_agrum_dot_org *
36
* homepage : http://agrum.gitlab.io *
37
* gitlab : https://gitlab.com/agrumery/agrum *
38
* *
39
****************************************************************************/
40
41
#pragma once
42
43
49
50
#include <
agrum/base/graphs/parts/edgeGraphPart.h
>
// to ease IDE parser
51
#ifndef DOXYGEN_SHOULD_SKIP_THIS
52
53
// to ease parsing by IDE
54
# include <
agrum/base/graphs/parts/edgeGraphPart.h
>
55
56
namespace
gum
{
57
58
template
<
typename
VAL >
59
EdgeProperty< VAL >
EdgeGraphPart::edgesProperty
(VAL (*f)(
const
Edge
&),
Size
size)
const
{
60
return
_edges_
.
hashMap
(f, size);
61
}
62
63
template
<
typename
VAL >
64
EdgeProperty< VAL >
EdgeGraphPart::edgesProperty
(
const
VAL& val,
Size
size)
const
{
65
return
_edges_
.
hashMap
(val, size);
66
}
67
68
template
<
typename
VAL >
69
List< VAL >
EdgeGraphPart::listMapEdges
(VAL (*f)(
const
Edge
&))
const
{
70
return
_edges_
.
listMap
(f);
71
}
72
73
}
/* namespace gum */
74
75
#endif
// DOXYGEN_SHOULD_SKIP_THIS
gum::EdgeGraphPart::edgesProperty
EdgeProperty< VAL > edgesProperty(VAL(*f)(const Edge &), Size size=0) const
a method to create a hashMap of VAL from a set of edges (using for every edge, say x,...
gum::EdgeGraphPart::_edges_
EdgeSet _edges_
the set of all the edges contained within the EdgeGraphPart
Definition
edgeGraphPart.h:238
gum::EdgeGraphPart::listMapEdges
List< VAL > listMapEdges(VAL(*f)(const Edge &)) const
a method to create a list of VAL from a set of edges (using for every edge, say x,...
gum::Edge
The base class for all undirected edges.
Definition
graphElements.h:164
gum::List
Generic doubly linked lists.
Definition
list.h:378
gum::Set::listMap
List< NewKey > listMap(NewKey(*f)(const Key &)) const
A method to create a List of NewKey from the set.
Definition
set_tpl.h:766
gum::Set::hashMap
HashTable< Key, NewKey > hashMap(NewKey(*f)(const Key &), Size capacity=0) const
Creates a hashtable of NewKey from the set.
Definition
set_tpl.h:724
edgeGraphPart.h
gum::Size
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Definition
types.h:74
gum::EdgeProperty
HashTable< Edge, VAL > EdgeProperty
Property on graph elements.
Definition
graphElements.h:409
gum
gum is the global namespace for all aGrUM entities
Definition
agrum.h:46
aGrUM
3.2.0
© PHW&CG&others - 2022
DoXyGeN 1.18.0