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
|
/*PGR-GNU*****************************************************************
File: maximumcardinalitymatching.hpp
Copyright (c) 2016-2026 pgRouting developers
Mail: project@pgrouting.org
Ignoring directed flag & works only for undirected graph
Copyright (c) 2022 Celia Virginia Vergara Castillo
Mail: vicky at erosion.dev
Function's developer:
Copyright (c) 2016 Andrea Nardelli
Mail: nrd.nardelli at gmail.com
------
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
********************************************************************PGR-GNU*/
#ifndef INCLUDE_MAX_FLOW_MAXIMUMCARDINALITYMATCHING_HPP_
#define INCLUDE_MAX_FLOW_MAXIMUMCARDINALITYMATCHING_HPP_
#pragma once
#include <set>
#include "cpp_common/undirectedNoCostBG.hpp"
namespace pgrouting {
namespace flow {
std::set<int64_t> maxCardinalityMatch(pgrouting::graph::UndirectedNoCostsBG&);
} // namespace flow
} // namespace pgrouting
#endif // INCLUDE_MAX_FLOW_MAXIMUMCARDINALITYMATCHING_HPP_
|
