/
BirdLeon
/
ROBLOX2016
Обзор
Документация
Войти
/
BirdLeon
/
ROBLOX2016
Код
Запросы
0
Задачи
Вики
Пакеты
0
Релизы
0
Аналитика
Безопасность
main
Library/boost/libs/graph/test/min_degree_empty.cpp
44 строки
1 KB
PatoFlamejanteTV
full source code
19 дек 2024, 19:11
19 дек 2024, 19:11
05db15d
Код
Авторство
О чём код?
//======================================================================= // Copyright 2017 Felix Salfelder // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) //======================================================================= #include <boost/graph/minimum_degree_ordering.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/property_map/property_map.hpp> #include <boost/core/lightweight_test.hpp> #include <boost/typeof/typeof.hpp> #include <vector> #include <map> typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::directedS > G; int main(int argc, char** argv) { size_t n = 10; G g(n); std::vector< int > inverse_perm(n, 0); std::vector< int > supernode_sizes(n, 1); BOOST_AUTO(id, boost::get(boost::vertex_index, g)); std::vector< int > degree(n, 0); std::map< int, int > io; std::map< int, int > o; boost::minimum_degree_ordering(g, boost::make_iterator_property_map(degree.begin(), id, degree[0]), boost::make_assoc_property_map(io), boost::make_assoc_property_map(o), boost::make_iterator_property_map( supernode_sizes.begin(), id, supernode_sizes[0]), 0, id); for (size_t k = 0; k < n; ++k) { BOOST_TEST(o[io[k]] == k); } return boost::report_errors(); }