Home
last modified time | relevance | path

Searched refs:check_edge (Results 1 – 3 of 3) sorted by relevance

/third_party/boost/libs/graph/example/
Dgraph.cpp51 template < class Graph > bool check_edge(Graph& g, std::size_t a, std::size_t b) in check_edge() function
80 is_failed = is_failed || (!check_edge(g, a, b)); in main()
98 is_failed = is_failed || check_edge(g, a, b); in main()
131 is_failed = is_failed || !check_edge(g, vid, a); in main()
132 is_failed = is_failed || !check_edge(g, b, vidp1); in main()
/third_party/boost/boost/geometry/algorithms/detail/overlay/
Dclip_linestring.hpp58 …inline bool check_edge(CoordinateType const& p, CoordinateType const& q, CalcType& t1, CalcType& t… in check_edge() function in boost::geometry::strategy::intersection::liang_barsky
119 if (check_edge(p1, q1, t1, t2) // left in clip_segment()
120 && check_edge(p2, q2, t1, t2) // right in clip_segment()
121 && check_edge(p3, q3, t1, t2) // bottom in clip_segment()
122 && check_edge(p4, q4, t1, t2)) // top in clip_segment()
/third_party/boost/libs/graph/test/
Dtwo_graphs_common_spanning_trees_test.cpp43 template < typename Coll, typename Seq > struct check_edge struct
112 check_edge< std::vector< std::vector< bool > >, std::vector< bool > > in two_graphs_common_spanning_trees_test()