24 #ifndef INCLUDE_PLANAR_PGR_BOYERMYRVOLD_HPP_
25 #define INCLUDE_PLANAR_PGR_BOYERMYRVOLD_HPP_
28 #include <boost/graph/adjacency_list.hpp>
29 #include <boost/graph/properties.hpp>
30 #include <boost/graph/graph_traits.hpp>
31 #include <boost/property_map/property_map.hpp>
32 #include <boost/graph/boyer_myrvold_planar_test.hpp>
33 #include <boost/graph/is_kuratowski_subgraph.hpp>
34 #include <boost/ref.hpp>
51 typedef typename G::E_i
E_i;
58 CHECK_FOR_INTERRUPTS();
60 return (boost::boyer_myrvold_planarity_test(graph.graph));
61 }
catch (boost::exception
const& ex) {
64 }
catch (std::exception &e) {
75 std::vector< pgr_boyer_t > results;
76 auto check = boost::boyer_myrvold_planarity_test(graph.graph);
79 for (boost::tie(ei, ei_end) = edges(graph.graph); ei != ei_end; ++ei) {
80 int64_t src = graph[graph.source(*ei)].id;
81 int64_t tgt = graph[graph.target(*ei)].id;
82 double cost = graph[*ei].cost;
87 results.push_back(tmp);
96 #endif // INCLUDE_PLANAR_PGR_BOYERMYRVOLD_HPP_