| /third_party/boost/libs/graph/example/ |
| D | vf2_sub_graph_iso_multi_example.cpp | 41 graph_type graph2; in main() local
43 add_vertex(vertex_property('a'), graph2); in main()
44 add_vertex(vertex_property('a'), graph2); in main()
45 add_vertex(vertex_property('a'), graph2); in main()
46 add_vertex(vertex_property('a'), graph2); in main()
47 add_vertex(vertex_property('a'), graph2); in main()
48 add_vertex(vertex_property('a'), graph2); in main()
50 add_edge(0, 1, edge_property('a'), graph2); in main()
51 add_edge(0, 1, edge_property('a'), graph2); in main()
52 add_edge(0, 1, edge_property('b'), graph2); in main()
[all …]
|
| D | vf2_sub_graph_iso_example.cpp | 32 graph_type graph2(num_vertices2); in main() local
33 add_edge(0, 6, graph2); in main()
34 add_edge(0, 8, graph2); in main()
35 add_edge(1, 5, graph2); in main()
36 add_edge(1, 7, graph2); in main()
37 add_edge(2, 4, graph2); in main()
38 add_edge(2, 7, graph2); in main()
39 add_edge(2, 8, graph2); in main()
40 add_edge(3, 4, graph2); in main()
41 add_edge(3, 5, graph2); in main()
[all …]
|
| /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
180 BGL_FORALL_OUTEDGES_T(existing_vertex2, edge2, graph2, GraphSecond) in can_extend_graph()
182 if (target(edge2, graph2) == new_vertex2) in can_extend_graph()
200 is_undirected2 = is_undirected(graph2); in can_extend_graph()
237 new_vertex2, edge2, graph2, GraphSecond) in can_extend_graph()
239 if (target(edge2, graph2) == existing_vertex2) in can_extend_graph()
291 const GraphSecond& graph2, const VertexIndexMapFirst& vindex_map1, in mcgregor_common_subgraphs_internal() argument
316 boost::tie(vertex2_begin, vertex2_end) = vertices(graph2); in mcgregor_common_subgraphs_internal()
332 BGL_FORALL_VERTICES_T(new_vertex2, graph2, GraphSecond) in mcgregor_common_subgraphs_internal()
347 if (can_extend_graph(graph1, graph2, correspondence_map_1_to_2, 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
481 , graph2_(graph2) 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
795 boost::tie(graph2_verts_iter, graph2_verts_iter_end) = vertices(graph2); in match()
1141 bool vf2_graph_iso(const Graph1& graph1, const Graph2& graph2, in vf2_graph_iso() argument
1191 if (num_vertices(graph1) != num_vertices(graph2)) in vf2_graph_iso()
[all …]
|
| /third_party/boost/libs/graph/test/ |
| D | isomorphism.cpp | 126 graph2; in test_isomorphism2() typedef
131 graph2 g2; in test_isomorphism2()
135 for (graph2::vertex_iterator v = vertices(g2).first; in test_isomorphism2()
141 std::map< graph1::vertex_descriptor, graph2::vertex_descriptor > mapping; in test_isomorphism2()
174 for (graph2::edge_iterator e = edges(g2).first; in test_isomorphism2()
190 graph2; in test_isomorphism() typedef
194 graph2 g2; in test_isomorphism()
198 for (graph2::vertex_iterator v = vertices(g2).first; in test_isomorphism()
204 std::map< graph1::vertex_descriptor, graph2::vertex_descriptor > mapping; in test_isomorphism()
236 for (graph2::edge_iterator e = edges(g2).first; in test_isomorphism()
|
| 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()
352 Graph common_subgraph, graph1, graph2; in main() local
356 VertexNameMap vname_map2 = get(boost::vertex_name, graph2); in main()
360 EdgeNameMap ename_map2 = get(boost::edge_name, graph2); in main()
388 boost::copy_graph(common_subgraph, graph2); in main()
394 add_random_vertices(graph2, generator, vertices_to_create, in main()
408 write_graphviz(file_graph2, graph2, make_label_writer(vname_map2), in main()
419 test_callback< Graph > user_callback(common_subgraph, graph1, graph2); in main()
421 boost::mcgregor_common_subgraphs(graph1, graph2, true, user_callback, in main()
|
| D | vf2_sub_graph_iso_test.cpp | 165 test_callback(const Graph1& graph1, const Graph2& graph2, in test_callback()
169 , graph2_(graph2) in test_callback()
245 graph2; in test_vf2_sub_graph_iso() typedef
248 graph2 g2(n2); in test_vf2_sub_graph_iso()
262 typedef property_map< graph2, vertex_name_t >::type vertex_name_map2; in test_vf2_sub_graph_iso()
270 typedef property_map< graph2, edge_name_t >::type edge_name_map2; 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()
|