/
BirdLeon
/
ROBLOX2016
Обзор
Документация
Войти
/
BirdLeon
/
ROBLOX2016
Код
Запросы
0
Задачи
Вики
Пакеты
0
Релизы
0
Аналитика
Безопасность
main
Library/boost/libs/graph/test/transitive_closure_test2.cpp
38 строк
1 KB
PatoFlamejanteTV
full source code
19 дек 2024, 19:11
19 дек 2024, 19:11
05db15d
Код
Авторство
О чём код?
// Copyright (C) 2004 Jeremy Siek <jsiek@cs.indiana.edu> // 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/adjacency_list.hpp> #include <boost/graph/depth_first_search.hpp> #include <boost/graph/transitive_closure.hpp> #include <iostream> using namespace std; using namespace boost; typedef adjacency_list<> graph_t; int main(int argc, char* argv[]) { graph_t g(5), g_TC; add_edge(0, 2, g); add_edge(1, 0, g); add_edge(1, 2, g); add_edge(1, 4, g); add_edge(3, 0, g); add_edge(3, 2, g); add_edge(4, 2, g); add_edge(4, 3, g); transitive_closure(g, g_TC); cout << "original graph: 0->2, 1->0, 1->2, 1->4, 3->0, 3->2, 4->2, 4->3" << endl; cout << "transitive closure: "; graph_t::edge_iterator i, iend; for (boost::tie(i, iend) = edges(g_TC); i != iend; ++i) { cout << source(*i, g_TC) << "->" << target(*i, g_TC) << " "; } cout << endl; }