graph_algo.hpp

Go to the documentation of this file.

 
#pragma once
 
#include <cassert>
#include <py2cpp/dict.hpp>
#include <py2cpp/set.hpp>
#include <utility>
 
template <typename Graph, typename WeightMap, typename CoverSet>
auto min_vertex_cover_fast(const Graph& ugraph, WeightMap& weight, CoverSet& coverset)
    -> std::pair<CoverSet, typename WeightMap::mapped_type>;
 
template <typename Graph, typename WeightMap>
auto min_vertex_cover_fast(const Graph& ugraph, WeightMap& weight)
    -> std::pair<py::set<typename Graph::node_t>, typename WeightMap::mapped_type> {
    py::set<typename Graph::node_t> coverset{};
    return min_vertex_cover_fast(ugraph, weight, coverset);
}
 
template <typename Graph, typename WeightMap, typename IndSet, typename DepSet>
auto min_maximal_independant_set(const Graph& ugraph, WeightMap& weight, IndSet& indset,
                                 DepSet& dep) -> std::pair<IndSet, typename WeightMap::mapped_type>;
 
template <typename Graph, typename WeightMap>
auto min_maximal_independant_set(const Graph& ugraph, WeightMap& weight)
    -> std::pair<py::set<typename Graph::node_t>, typename WeightMap::mapped_type> {
    py::set<typename Graph::node_t> indset{};
    py::set<typename Graph::node_t> dep{};
    return min_maximal_independant_set(ugraph, weight, indset, dep);
}