k.inabaさんおすすめの『最短経路の本』でグラフ理論の勉強中。 簡単なグラフを用意して、 Boost.Graphで最短経路の計算。 #include <iostream> #include <vector> #include <string> #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/dijkstra_shortest_paths.hpp> #include <boost/graph/graph_utility.hpp> #include <boost/spirit/home/phoenix/algorithm.hpp> using namespace boost; typedef adjacency_list<listS
![Boost.Graphに入門 - Faith and Brave - C++で遊ぼう](https://cdn-ak-scissors.b.st-hatena.com/image/square/2aff5ea067c5a9d7996855ca7774b7744e168097/height=288;version=1;width=512/http%3A%2F%2Fcdn-ak.f.st-hatena.com%2Fimages%2Ffotolife%2Ff%2Ffaith_and_brave%2F20100413%2F20100413130030.png)