| /third_party/boost/libs/graph/example/ |
| D | vf2_sub_graph_iso_multi_example.cpp | 25 graph_type graph1; in main() local
27 add_vertex(vertex_property('a'), graph1); in main()
28 add_vertex(vertex_property('a'), graph1); in main()
29 add_vertex(vertex_property('a'), graph1); in main()
31 add_edge(0, 1, edge_property('b'), graph1); in main()
32 add_edge(0, 1, edge_property('b'), graph1); in main()
33 add_edge(0, 1, edge_property('d'), graph1); in main()
35 add_edge(1, 2, edge_property('s'), graph1); in main()
37 add_edge(2, 2, edge_property('l'), graph1); in main()
38 add_edge(2, 2, edge_property('l'), graph1); in main()
[all …]
|
| D | vf2_sub_graph_iso_example.cpp | 20 graph_type graph1(num_vertices1); in main() local
21 add_edge(0, 6, graph1); in main()
22 add_edge(0, 7, graph1); in main()
23 add_edge(1, 5, graph1); in main()
24 add_edge(1, 7, graph1); in main()
25 add_edge(2, 4, graph1); in main()
26 add_edge(2, 5, graph1); in main()
27 add_edge(2, 6, graph1); in main()
28 add_edge(3, 4, graph1); in main()
45 vf2_print_callback< graph_type, graph_type > callback(graph1, graph2); in main()
[all …]
|
| D | mcgregor_subgraphs_example.cpp | 31 example_callback(const Graph& graph1) : m_graph1(graph1) {} in example_callback()
|
| /third_party/boost/boost/graph/ |
| D | mcgregor_common_subgraphs.hpp | 116 bool can_extend_graph(const GraphFirst& graph1, const GraphSecond& graph2, in can_extend_graph() argument
148 BGL_FORALL_VERTICES_T(existing_vertex1, graph1, GraphFirst) in can_extend_graph()
169 BGL_FORALL_OUTEDGES_T(existing_vertex1, edge1, graph1, GraphFirst) in can_extend_graph()
171 if (target(edge1, graph1) == new_vertex1) in can_extend_graph()
199 bool is_undirected1 = is_undirected(graph1), in can_extend_graph()
221 new_vertex1, edge1, graph1, GraphFirst) in can_extend_graph()
223 if (target(edge1, graph1) == existing_vertex1) in can_extend_graph()
290 bool mcgregor_common_subgraphs_internal(const GraphFirst& graph1, in mcgregor_common_subgraphs_internal() argument
315 boost::tie(vertex1_iter, vertex1_end) = vertices(graph1); in mcgregor_common_subgraphs_internal()
320 BGL_FORALL_VERTICES_T(new_vertex1, graph1, GraphFirst) in mcgregor_common_subgraphs_internal()
[all …]
|
| D | vf2_sub_graph_iso.hpp | 52 vf2_print_callback(const Graph1& graph1, const Graph2& graph2) in vf2_print_callback()
53 : graph1_(graph1), graph2_(graph2) in vf2_print_callback()
477 state(const Graph1& graph1, const Graph2& graph2, IndexMap1 index_map1, in state() argument
480 : graph1_(graph1) in state()
485 , state1_(graph1, graph2, index_map1, index_map2) in state()
486 , state2_(graph2, graph1, index_map2, index_map1) in state()
757 bool match(const Graph1& graph1, const Graph2& graph2, in match() argument
1141 bool vf2_graph_iso(const Graph1& graph1, const Graph2& graph2, in vf2_graph_iso() argument
1189 BOOST_ASSERT(num_vertices(graph1) == vertex_order1.size()); in vf2_graph_iso()
1191 if (num_vertices(graph1) != num_vertices(graph2)) in vf2_graph_iso()
[all …]
|
| /third_party/boost/libs/graph/test/ |
| D | mcgregor_subgraphs_test.cpp | 37 Graph& common_subgraph, const Graph& graph1, const Graph& graph2) in test_callback()
38 : m_graph1(graph1), m_graph2(graph2), m_common_subgraph(common_subgraph) in test_callback()
212 simple_callback(const Graph& graph1) : m_graph1(graph1) {} in simple_callback()
352 Graph common_subgraph, graph1, graph2; in main() local
355 VertexNameMap vname_map1 = get(boost::vertex_name, graph1); in main()
359 EdgeNameMap ename_map1 = get(boost::edge_name, graph1); in main()
387 boost::copy_graph(common_subgraph, graph1); in main()
391 add_random_vertices(graph1, generator, vertices_to_create, in main()
405 write_graphviz(file_graph1, graph1, make_label_writer(vname_map1), in main()
419 test_callback< Graph > user_callback(common_subgraph, graph1, graph2); in main()
[all …]
|
| D | isomorphism.cpp | 123 typedef adjacency_list< vecS, vecS, bidirectionalS > graph1; in test_isomorphism2() typedef
128 graph1 g1(2); in test_isomorphism2()
141 std::map< graph1::vertex_descriptor, graph2::vertex_descriptor > mapping; in test_isomorphism2()
162 for (graph1::edge_iterator e = edges(g1).first; in test_isomorphism2()
187 typedef adjacency_list< vecS, vecS, bidirectionalS > graph1; in test_isomorphism() typedef
192 graph1 g1(n); in test_isomorphism()
204 std::map< graph1::vertex_descriptor, graph2::vertex_descriptor > mapping; in test_isomorphism()
224 for (graph1::edge_iterator e = edges(g1).first; in test_isomorphism()
|
| D | vf2_sub_graph_iso_test.cpp | 165 test_callback(const Graph1& graph1, const Graph2& graph2, in test_callback()
168 : graph1_(graph1) in test_callback()
242 graph1; in test_vf2_sub_graph_iso() typedef
247 graph1 g1(n1); in test_vf2_sub_graph_iso()
254 for (graph_traits< graph1 >::vertex_iterator vi = vertices(g1).first; in test_vf2_sub_graph_iso()
261 typedef property_map< graph1, vertex_name_t >::type vertex_name_map1; in test_vf2_sub_graph_iso()
269 typedef property_map< graph1, edge_name_t >::type edge_name_map1; in test_vf2_sub_graph_iso()
280 test_callback< graph1, graph2, edge_predicate, vertex_predicate > callback( in test_vf2_sub_graph_iso()
287 IndirectIndexMap< graph1 >(g1), IndirectIndexMap< graph2 >(g2), in test_vf2_sub_graph_iso()
|