【文件属性】：
文件名称：boost_graph_cookbook_2:Boost.Graph食谱2
文件大小：1.03MB
文件格式：ZIP
更新时间：2021-04-30 15:00:20
C++
Boost.Graph食谱2：算法
分支
掌握
开发
“ Boost.Graph Cookbook 2：算法”是有关Boost.Graph的C ++教程，它是该系列的一部分：
资料下载：
稳定： （v3.0）
不稳定： （v3.0。？）
本教程提供了使用Boost.Graph的示例，这些示例是：
按时间顺序排列概念
逐渐增加复杂性
显示完整的代码
Boost.Graph是一部分的C ++库。
我要贡献！
参见CONTRIBUTING.md 。
其他资源
Siek，Jeremy G.，Lie-Quan Lee和Andrew Lumsdaine。 Boost Graph Library：《用户指南和参考手册》。 培生教育，2001年
Boost.Graph网站， http：//www.boost.org/doc/libs/release/libs/graph/doc
【文件预览】：
boost_graph_cookbook_2-master
----boost_graph_cookbook_2.pdf(416KB)
----.gitignore(303B)
----get_code_cov(292B)
----Codecov.png(1KB)
----install_oclint.sh(188B)
----.travis.yml(2KB)
----TravisCI.png(5KB)
----CONTRIBUTING.md(3KB)
----LICENSE(7KB)
----build_pdf(82B)
----checkout_all_branches(43B)
----README.md(2KB)
----boost_graph_cookbook_2()
--------boost_graph_cookbook_2.pdf(416KB)
--------create_all_direct_neighbour_subgraphs_test.cpp(1KB)
--------boost_graph_cookbook_2_bundled_edges_and_vertices.pri(152B)
--------boost_graph_cookbook_2_graphviz_only_unsure.pri(0B)
--------count_undirected_graph_levels.cpp(43B)
--------count_undirected_graph_connected_components.impl(446B)
--------boost_graph_cookbook_2_test_pics.lyx(3KB)
--------count_max_number_of_pieces_test.cpp(961B)
--------CC-BY-SA_icon.svg(7KB)
--------create_direct_neighbour_subgraph_including_in_edges.cpp(46B)
--------any_test.pri(1022B)
--------count_undirected_graph_levels_test.cpp(909B)
--------boost_graph_cookbook_2_no_properties.pri(126B)
--------boost_graph_cookbook_2_tutorial.pri(116B)
--------create_all_direct_neighbour_subgraphs_demo.impl(416B)
--------boost_graph_cookbook_2_no_graphviz_bundled_edges_and_vertices.pri(39B)
--------boost_graph_cookbook_2_test_no_graphviz.pri(813B)
--------create_direct_neighbour_subgraph_test.cpp(1KB)
--------boost_graph_cookbook_2_graphviz_only_misc.pri(17B)
--------boost_graph_cookbook_2_graphviz_only.pri(232B)
--------create_all_direct_neighbour_subgraphs.cpp(51B)
--------boost_graph_cookbook_2_misc.pri(108B)
--------create_all_direct_neighbour_subgraphs.impl(494B)
--------count_directed_graph_connected_components.impl(418B)
--------boost_graph_cookbook_2_no_graphviz_bundled_vertices.pri(39B)
--------boost_graph_cookbook_2_test_no_graphviz.pro(982B)
--------count_directed_graph_connected_components.h(218B)
--------count_max_number_of_pieces.h(2KB)
--------boost_graph_cookbook_2.lyx(38KB)
--------boost_graph_cookbook_2_no_graphviz_unsure.pri(0B)
--------create_direct_neighbour_subgraph_including_in_edges_test.cpp(1KB)
--------create_direct_neighbour_subgraph.impl(1KB)
--------Doxyfile(98KB)
--------title_graph.dot(317B)
--------count_undirected_graph_connected_components_test.cpp(699B)
--------boost_graph_cookbook_2_no_graphviz_misc.pri(0B)
--------title_graph.png(140KB)
--------boost_graph_cookbook_2_no_graphviz.pro(357B)
--------count_directed_graph_connected_components_demo.impl(924B)
--------boost_graph_cookbook_2_no_graphviz_tutorial.pri(0B)
--------create_direct_neighbour_subgraph_demo.impl(475B)
--------count_directed_graph_connected_components.cpp(55B)
--------boost_graph_cookbook_2_no_graphviz_no_properties.pri(1KB)
--------boost_graph_cookbook_2_no_graphviz.pri(202B)
--------boost_graph_cookbook_2_graphviz_only_bundled_edges_and_vertices.pri(39B)
--------count_undirected_graph_connected_components.cpp(57B)
--------CC-BY-SA_icon.png(5KB)
--------count_undirected_graph_connected_components.h(226B)
--------main_test.cpp(145B)
--------count_max_number_of_pieces.cpp(41B)
--------boost_graph_cookbook_2.pri(98B)
--------create_direct_neighbour_subgraph.cpp(46B)
--------boost_graph_cookbook_2.bib(2KB)
--------create_direct_neighbour_subgraph_including_in_edges.impl(1KB)
--------boost_graph_cookbook_2_helper.pri(112B)
--------boost_graph_cookbook_2_graphviz_only_helper.pri(0B)
--------title_graph.svg(15KB)
--------boost_graph_cookbook_2_bundled_vertices.pri(132B)
--------count_undirected_graph_levels.impl(924B)
--------boost_graph_cookbook_2_test.pri(108B)
--------boost_graph_cookbook_2_test.pro(772B)
--------boost_graph_cookbook_2_graphviz_only_no_properties.pri(39B)
--------create_direct_neighbour_subgraph.h(182B)
--------main.cpp(36B)
--------boost_graph_cookbook_2_graphviz_only_tutorial.pri(10B)
--------boost_graph_cookbook_2_graphviz_only_bundled_vertices.pri(39B)
--------boost_graph_cookbook_2_test_graphviz_only.pri(40B)
--------create_direct_neighbour_subgraph_including_in_edges.h(258B)
--------create_direct_neighbour_subgraph_including_in_edges_demo.impl(532B)
--------create_all_direct_neighbour_subgraphs.h(202B)
--------any_normal.pri(613B)
--------count_directed_graph_connected_components_test.cpp(1KB)
--------boost_graph_cookbook_2_no_graphviz_helper.pri(0B)
--------.qmake.stash(6KB)
--------count_undirected_graph_levels.h(188B)
--------count_undirected_graph_connected_components_demo.impl(512B)
--------boost_graph_cookbook_2_unsure.pri(0B)
--------boost_graph_cookbook_2.pro(766B)
--------count_undirected_graph_levels_demo.impl(760B)
----do_oclint.sh(794B)
----.Rhistory(0B)
----clean.sh(642B)