forked from jonstewart/boost-svn
-
Notifications
You must be signed in to change notification settings - Fork 0
/
mcgregor_common_subgraphs.hpp
1142 lines (950 loc) · 42.3 KB
/
mcgregor_common_subgraphs.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//=======================================================================
// Copyright 2009 Trustees of Indiana University.
// Authors: Michael Hansen, Andrew Lumsdaine
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
#ifndef BOOST_GRAPH_MCGREGOR_COMMON_SUBGRAPHS_HPP
#define BOOST_GRAPH_MCGREGOR_COMMON_SUBGRAPHS_HPP
#include <algorithm>
#include <vector>
#include <stack>
#include <boost/make_shared.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/filtered_graph.hpp>
#include <boost/graph/graph_utility.hpp>
#include <boost/graph/iteration_macros.hpp>
#include <boost/graph/properties.hpp>
#include <boost/property_map/shared_array_property_map.hpp>
namespace boost {
namespace detail {
// Traits associated with common subgraphs, used mainly to keep a
// consistent type for the correspondence maps.
template <typename GraphFirst,
typename GraphSecond,
typename VertexIndexMapFirst,
typename VertexIndexMapSecond>
struct mcgregor_common_subgraph_traits {
typedef typename graph_traits<GraphFirst>::vertex_descriptor vertex_first_type;
typedef typename graph_traits<GraphSecond>::vertex_descriptor vertex_second_type;
typedef shared_array_property_map<vertex_second_type, VertexIndexMapFirst>
correspondence_map_first_to_second_type;
typedef shared_array_property_map<vertex_first_type, VertexIndexMapSecond>
correspondence_map_second_to_first_type;
};
} // namespace detail
// ==========================================================================
// Binary function object that returns true if the values for item1
// in property_map1 and item2 in property_map2 are equivalent.
template <typename PropertyMapFirst,
typename PropertyMapSecond>
struct property_map_equivalent {
property_map_equivalent(const PropertyMapFirst property_map1,
const PropertyMapSecond property_map2) :
m_property_map1(property_map1),
m_property_map2(property_map2) { }
template <typename ItemFirst,
typename ItemSecond>
bool operator()(const ItemFirst item1, const ItemSecond item2) {
return (get(m_property_map1, item1) == get(m_property_map2, item2));
}
private:
const PropertyMapFirst m_property_map1;
const PropertyMapSecond m_property_map2;
};
// Returns a property_map_equivalent object that compares the values
// of property_map1 and property_map2.
template <typename PropertyMapFirst,
typename PropertyMapSecond>
property_map_equivalent<PropertyMapFirst,
PropertyMapSecond>
make_property_map_equivalent
(const PropertyMapFirst property_map1,
const PropertyMapSecond property_map2) {
return (property_map_equivalent<PropertyMapFirst, PropertyMapSecond>
(property_map1, property_map2));
}
// Binary function object that always returns true. Used when
// vertices or edges are always equivalent (i.e. have no labels).
struct always_equivalent {
template <typename ItemFirst,
typename ItemSecond>
bool operator()(const ItemFirst&, const ItemSecond&) {
return (true);
}
};
// ==========================================================================
namespace detail {
// Return true if new_vertex1 and new_vertex2 can extend the
// subgraph represented by correspondence_map_1_to_2 and
// correspondence_map_2_to_1. The vertices_equivalent and
// edges_equivalent predicates are used to test vertex and edge
// equivalency between the two graphs.
template <typename GraphFirst,
typename GraphSecond,
typename CorrespondenceMapFirstToSecond,
typename CorrespondenceMapSecondToFirst,
typename EdgeEquivalencePredicate,
typename VertexEquivalencePredicate>
bool can_extend_graph
(const GraphFirst& graph1,
const GraphSecond& graph2,
CorrespondenceMapFirstToSecond correspondence_map_1_to_2,
CorrespondenceMapSecondToFirst /*correspondence_map_2_to_1*/,
typename graph_traits<GraphFirst>::vertices_size_type subgraph_size,
typename graph_traits<GraphFirst>::vertex_descriptor new_vertex1,
typename graph_traits<GraphSecond>::vertex_descriptor new_vertex2,
EdgeEquivalencePredicate edges_equivalent,
VertexEquivalencePredicate vertices_equivalent,
bool only_connected_subgraphs)
{
typedef typename graph_traits<GraphFirst>::vertex_descriptor VertexFirst;
typedef typename graph_traits<GraphSecond>::vertex_descriptor VertexSecond;
typedef typename graph_traits<GraphFirst>::edge_descriptor EdgeFirst;
typedef typename graph_traits<GraphSecond>::edge_descriptor EdgeSecond;
// Check vertex equality
if (!vertices_equivalent(new_vertex1, new_vertex2)) {
return (false);
}
// Vertices match and graph is empty, so we can extend the subgraph
if (subgraph_size == 0) {
return (true);
}
bool has_one_edge = false;
// Verify edges with existing sub-graph
BGL_FORALL_VERTICES_T(existing_vertex1, graph1, GraphFirst) {
VertexSecond existing_vertex2 = get(correspondence_map_1_to_2, existing_vertex1);
// Skip unassociated vertices
if (existing_vertex2 == graph_traits<GraphSecond>::null_vertex()) {
continue;
}
// NOTE: This will not work with parallel edges, since the
// first matching edge is always chosen.
EdgeFirst edge_to_new1, edge_from_new1;
bool edge_to_new_exists1 = false, edge_from_new_exists1 = false;
EdgeSecond edge_to_new2, edge_from_new2;
bool edge_to_new_exists2 = false, edge_from_new_exists2 = false;
// Search for edge from existing to new vertex (graph1)
BGL_FORALL_OUTEDGES_T(existing_vertex1, edge1, graph1, GraphFirst) {
if (target(edge1, graph1) == new_vertex1) {
edge_to_new1 = edge1;
edge_to_new_exists1 = true;
break;
}
}
// Search for edge from existing to new vertex (graph2)
BGL_FORALL_OUTEDGES_T(existing_vertex2, edge2, graph2, GraphSecond) {
if (target(edge2, graph2) == new_vertex2) {
edge_to_new2 = edge2;
edge_to_new_exists2 = true;
break;
}
}
// Make sure edges from existing to new vertices are equivalent
if ((edge_to_new_exists1 != edge_to_new_exists2) ||
((edge_to_new_exists1 && edge_to_new_exists2) &&
!edges_equivalent(edge_to_new1, edge_to_new2))) {
return (false);
}
bool is_undirected1 = is_undirected(graph1),
is_undirected2 = is_undirected(graph2);
if (is_undirected1 && is_undirected2) {
// Edge in both graphs exists and both graphs are undirected
if (edge_to_new_exists1 && edge_to_new_exists2) {
has_one_edge = true;
}
continue;
}
else {
if (!is_undirected1) {
// Search for edge from new to existing vertex (graph1)
BGL_FORALL_OUTEDGES_T(new_vertex1, edge1, graph1, GraphFirst) {
if (target(edge1, graph1) == existing_vertex1) {
edge_from_new1 = edge1;
edge_from_new_exists1 = true;
break;
}
}
}
if (!is_undirected2) {
// Search for edge from new to existing vertex (graph2)
BGL_FORALL_OUTEDGES_T(new_vertex2, edge2, graph2, GraphSecond) {
if (target(edge2, graph2) == existing_vertex2) {
edge_from_new2 = edge2;
edge_from_new_exists2 = true;
break;
}
}
}
// Make sure edges from new to existing vertices are equivalent
if ((edge_from_new_exists1 != edge_from_new_exists2) ||
((edge_from_new_exists1 && edge_from_new_exists2) &&
!edges_equivalent(edge_from_new1, edge_from_new2))) {
return (false);
}
if ((edge_from_new_exists1 && edge_from_new_exists2) ||
(edge_to_new_exists1 && edge_to_new_exists2)) {
has_one_edge = true;
}
} // else
} // BGL_FORALL_VERTICES_T
// Make sure new vertices are connected to the existing subgraph
if (only_connected_subgraphs && !has_one_edge) {
return (false);
}
return (true);
}
// Recursive method that does a depth-first search in the space of
// potential subgraphs. At each level, every new vertex pair from
// both graphs is tested to see if it can extend the current
// subgraph. If so, the subgraph is output to subgraph_callback
// in the form of two correspondence maps (one for each graph).
// Returning false from subgraph_callback will terminate the
// search. Function returns true if the entire search space was
// explored.
template <typename GraphFirst,
typename GraphSecond,
typename VertexIndexMapFirst,
typename VertexIndexMapSecond,
typename CorrespondenceMapFirstToSecond,
typename CorrespondenceMapSecondToFirst,
typename VertexStackFirst,
typename EdgeEquivalencePredicate,
typename VertexEquivalencePredicate,
typename SubGraphInternalCallback>
bool mcgregor_common_subgraphs_internal
(const GraphFirst& graph1,
const GraphSecond& graph2,
const VertexIndexMapFirst& vindex_map1,
const VertexIndexMapSecond& vindex_map2,
CorrespondenceMapFirstToSecond correspondence_map_1_to_2,
CorrespondenceMapSecondToFirst correspondence_map_2_to_1,
VertexStackFirst& vertex_stack1,
EdgeEquivalencePredicate edges_equivalent,
VertexEquivalencePredicate vertices_equivalent,
bool only_connected_subgraphs,
SubGraphInternalCallback subgraph_callback)
{
typedef typename graph_traits<GraphFirst>::vertex_descriptor VertexFirst;
typedef typename graph_traits<GraphSecond>::vertex_descriptor VertexSecond;
typedef typename graph_traits<GraphFirst>::vertices_size_type VertexSizeFirst;
// Get iterators for vertices from both graphs
typename graph_traits<GraphFirst>::vertex_iterator
vertex1_iter, vertex1_end;
typename graph_traits<GraphSecond>::vertex_iterator
vertex2_begin, vertex2_end, vertex2_iter;
tie(vertex1_iter, vertex1_end) = vertices(graph1);
tie(vertex2_begin, vertex2_end) = vertices(graph2);
vertex2_iter = vertex2_begin;
// Iterate until all vertices have been visited
BGL_FORALL_VERTICES_T(new_vertex1, graph1, GraphFirst) {
VertexSecond existing_vertex2 = get(correspondence_map_1_to_2, new_vertex1);
// Skip already matched vertices in first graph
if (existing_vertex2 != graph_traits<GraphSecond>::null_vertex()) {
continue;
}
BGL_FORALL_VERTICES_T(new_vertex2, graph2, GraphSecond) {
VertexFirst existing_vertex1 = get(correspondence_map_2_to_1, new_vertex2);
// Skip already matched vertices in second graph
if (existing_vertex1 != graph_traits<GraphFirst>::null_vertex()) {
continue;
}
// Check if current sub-graph can be extended with the matched vertex pair
if (can_extend_graph(graph1, graph2,
correspondence_map_1_to_2, correspondence_map_2_to_1,
(VertexSizeFirst)vertex_stack1.size(),
new_vertex1, new_vertex2,
edges_equivalent, vertices_equivalent,
only_connected_subgraphs)) {
// Keep track of old graph size for restoring later
VertexSizeFirst old_graph_size = (VertexSizeFirst)vertex_stack1.size(),
new_graph_size = old_graph_size + 1;
// Extend subgraph
put(correspondence_map_1_to_2, new_vertex1, new_vertex2);
put(correspondence_map_2_to_1, new_vertex2, new_vertex1);
vertex_stack1.push(new_vertex1);
// Only output sub-graphs larger than a single vertex
if (new_graph_size > 1) {
// Returning false from the callback will cancel iteration
if (!subgraph_callback(correspondence_map_1_to_2,
correspondence_map_2_to_1,
new_graph_size)) {
return (false);
}
}
// Depth-first search into the state space of possible sub-graphs
bool continue_iteration =
mcgregor_common_subgraphs_internal
(graph1, graph2,
vindex_map1, vindex_map2,
correspondence_map_1_to_2, correspondence_map_2_to_1,
vertex_stack1,
edges_equivalent, vertices_equivalent,
only_connected_subgraphs, subgraph_callback);
if (!continue_iteration) {
return (false);
}
// Restore previous state
if (vertex_stack1.size() > old_graph_size) {
VertexFirst stack_vertex1 = vertex_stack1.top();
VertexSecond stack_vertex2 = get(correspondence_map_1_to_2,
stack_vertex1);
// Contract subgraph
put(correspondence_map_1_to_2, stack_vertex1,
graph_traits<GraphSecond>::null_vertex());
put(correspondence_map_2_to_1, stack_vertex2,
graph_traits<GraphFirst>::null_vertex());
vertex_stack1.pop();
}
} // if can_extend_graph
} // BGL_FORALL_VERTICES_T (graph2)
} // BGL_FORALL_VERTICES_T (graph1)
return (true);
}
// Internal method that initializes blank correspondence maps and
// a vertex stack for use in mcgregor_common_subgraphs_internal.
template <typename GraphFirst,
typename GraphSecond,
typename VertexIndexMapFirst,
typename VertexIndexMapSecond,
typename EdgeEquivalencePredicate,
typename VertexEquivalencePredicate,
typename SubGraphInternalCallback>
inline void mcgregor_common_subgraphs_internal_init
(const GraphFirst& graph1,
const GraphSecond& graph2,
const VertexIndexMapFirst vindex_map1,
const VertexIndexMapSecond vindex_map2,
EdgeEquivalencePredicate edges_equivalent,
VertexEquivalencePredicate vertices_equivalent,
bool only_connected_subgraphs,
SubGraphInternalCallback subgraph_callback)
{
typedef mcgregor_common_subgraph_traits<GraphFirst,
GraphSecond, VertexIndexMapFirst,
VertexIndexMapSecond> SubGraphTraits;
typename SubGraphTraits::correspondence_map_first_to_second_type
correspondence_map_1_to_2(num_vertices(graph1), vindex_map1);
BGL_FORALL_VERTICES_T(vertex1, graph1, GraphFirst) {
put(correspondence_map_1_to_2, vertex1,
graph_traits<GraphSecond>::null_vertex());
}
typename SubGraphTraits::correspondence_map_second_to_first_type
correspondence_map_2_to_1(num_vertices(graph2), vindex_map2);
BGL_FORALL_VERTICES_T(vertex2, graph2, GraphSecond) {
put(correspondence_map_2_to_1, vertex2,
graph_traits<GraphFirst>::null_vertex());
}
typedef typename graph_traits<GraphFirst>::vertex_descriptor
VertexFirst;
std::stack<VertexFirst> vertex_stack1;
mcgregor_common_subgraphs_internal
(graph1, graph2,
vindex_map1, vindex_map2,
correspondence_map_1_to_2, correspondence_map_2_to_1,
vertex_stack1,
edges_equivalent, vertices_equivalent,
only_connected_subgraphs,
subgraph_callback);
}
} // namespace detail
// ==========================================================================
// Enumerates all common subgraphs present in graph1 and graph2.
// Continues until the search space has been fully explored or false
// is returned from user_callback.
template <typename GraphFirst,
typename GraphSecond,
typename VertexIndexMapFirst,
typename VertexIndexMapSecond,
typename EdgeEquivalencePredicate,
typename VertexEquivalencePredicate,
typename SubGraphCallback>
void mcgregor_common_subgraphs
(const GraphFirst& graph1,
const GraphSecond& graph2,
const VertexIndexMapFirst vindex_map1,
const VertexIndexMapSecond vindex_map2,
EdgeEquivalencePredicate edges_equivalent,
VertexEquivalencePredicate vertices_equivalent,
bool only_connected_subgraphs,
SubGraphCallback user_callback)
{
detail::mcgregor_common_subgraphs_internal_init
(graph1, graph2,
vindex_map1, vindex_map2,
edges_equivalent, vertices_equivalent,
only_connected_subgraphs,
user_callback);
}
// Variant of mcgregor_common_subgraphs with all default parameters
template <typename GraphFirst,
typename GraphSecond,
typename SubGraphCallback>
void mcgregor_common_subgraphs
(const GraphFirst& graph1,
const GraphSecond& graph2,
bool only_connected_subgraphs,
SubGraphCallback user_callback)
{
detail::mcgregor_common_subgraphs_internal_init
(graph1, graph2,
get(vertex_index, graph1), get(vertex_index, graph2),
always_equivalent(), always_equivalent(),
only_connected_subgraphs, user_callback);
}
// Named parameter variant of mcgregor_common_subgraphs
template <typename GraphFirst,
typename GraphSecond,
typename SubGraphCallback,
typename Param,
typename Tag,
typename Rest>
void mcgregor_common_subgraphs
(const GraphFirst& graph1,
const GraphSecond& graph2,
bool only_connected_subgraphs,
SubGraphCallback user_callback,
const bgl_named_params<Param, Tag, Rest>& params)
{
detail::mcgregor_common_subgraphs_internal_init
(graph1, graph2,
choose_const_pmap(get_param(params, vertex_index1),
graph1, vertex_index),
choose_const_pmap(get_param(params, vertex_index2),
graph2, vertex_index),
choose_param(get_param(params, edges_equivalent_t()),
always_equivalent()),
choose_param(get_param(params, vertices_equivalent_t()),
always_equivalent()),
only_connected_subgraphs, user_callback);
}
// ==========================================================================
namespace detail {
// Binary function object that intercepts subgraphs from
// mcgregor_common_subgraphs_internal and maintains a cache of
// unique subgraphs. The user callback is invoked for each unique
// subgraph.
template <typename GraphFirst,
typename GraphSecond,
typename VertexIndexMapFirst,
typename VertexIndexMapSecond,
typename SubGraphCallback>
struct unique_subgraph_interceptor {
typedef typename graph_traits<GraphFirst>::vertices_size_type
VertexSizeFirst;
typedef mcgregor_common_subgraph_traits<GraphFirst, GraphSecond,
VertexIndexMapFirst, VertexIndexMapSecond> SubGraphTraits;
typedef typename SubGraphTraits::correspondence_map_first_to_second_type
CachedCorrespondenceMapFirstToSecond;
typedef typename SubGraphTraits::correspondence_map_second_to_first_type
CachedCorrespondenceMapSecondToFirst;
typedef std::pair<VertexSizeFirst,
std::pair<CachedCorrespondenceMapFirstToSecond,
CachedCorrespondenceMapSecondToFirst> > SubGraph;
typedef std::vector<SubGraph> SubGraphList;
unique_subgraph_interceptor(const GraphFirst& graph1,
const GraphSecond& graph2,
const VertexIndexMapFirst vindex_map1,
const VertexIndexMapSecond vindex_map2,
SubGraphCallback user_callback) :
m_graph1(graph1), m_graph2(graph2),
m_vindex_map1(vindex_map1), m_vindex_map2(vindex_map2),
m_subgraphs(make_shared<SubGraphList>()),
m_user_callback(user_callback) { }
template <typename CorrespondenceMapFirstToSecond,
typename CorrespondenceMapSecondToFirst>
bool operator()(CorrespondenceMapFirstToSecond correspondence_map_1_to_2,
CorrespondenceMapSecondToFirst correspondence_map_2_to_1,
VertexSizeFirst subgraph_size) {
for (typename SubGraphList::const_iterator
subgraph_iter = m_subgraphs->begin();
subgraph_iter != m_subgraphs->end();
++subgraph_iter) {
SubGraph subgraph_cached = *subgraph_iter;
// Compare subgraph sizes
if (subgraph_size != subgraph_cached.first) {
continue;
}
if (!are_property_maps_different(correspondence_map_1_to_2,
subgraph_cached.second.first,
m_graph1)) {
// New subgraph is a duplicate
return (true);
}
}
// Subgraph is unique, so make a cached copy
CachedCorrespondenceMapFirstToSecond
new_subgraph_1_to_2 = CachedCorrespondenceMapFirstToSecond
(num_vertices(m_graph1), m_vindex_map1);
CachedCorrespondenceMapSecondToFirst
new_subgraph_2_to_1 = CorrespondenceMapSecondToFirst
(num_vertices(m_graph2), m_vindex_map2);
BGL_FORALL_VERTICES_T(vertex1, m_graph1, GraphFirst) {
put(new_subgraph_1_to_2, vertex1, get(correspondence_map_1_to_2, vertex1));
}
BGL_FORALL_VERTICES_T(vertex2, m_graph2, GraphFirst) {
put(new_subgraph_2_to_1, vertex2, get(correspondence_map_2_to_1, vertex2));
}
m_subgraphs->push_back(std::make_pair(subgraph_size,
std::make_pair(new_subgraph_1_to_2,
new_subgraph_2_to_1)));
return (m_user_callback(correspondence_map_1_to_2,
correspondence_map_2_to_1,
subgraph_size));
}
private:
const GraphFirst& m_graph1;
const GraphFirst& m_graph2;
const VertexIndexMapFirst m_vindex_map1;
const VertexIndexMapSecond m_vindex_map2;
shared_ptr<SubGraphList> m_subgraphs;
SubGraphCallback m_user_callback;
};
} // namespace detail
// Enumerates all unique common subgraphs between graph1 and graph2.
// The user callback is invoked for each unique subgraph as they are
// discovered.
template <typename GraphFirst,
typename GraphSecond,
typename VertexIndexMapFirst,
typename VertexIndexMapSecond,
typename EdgeEquivalencePredicate,
typename VertexEquivalencePredicate,
typename SubGraphCallback>
void mcgregor_common_subgraphs_unique
(const GraphFirst& graph1,
const GraphSecond& graph2,
const VertexIndexMapFirst vindex_map1,
const VertexIndexMapSecond vindex_map2,
EdgeEquivalencePredicate edges_equivalent,
VertexEquivalencePredicate vertices_equivalent,
bool only_connected_subgraphs,
SubGraphCallback user_callback)
{
detail::unique_subgraph_interceptor<GraphFirst, GraphSecond,
VertexIndexMapFirst, VertexIndexMapSecond,
SubGraphCallback> unique_callback
(graph1, graph2,
vindex_map1, vindex_map2,
user_callback);
detail::mcgregor_common_subgraphs_internal_init
(graph1, graph2,
vindex_map1, vindex_map2,
edges_equivalent, vertices_equivalent,
only_connected_subgraphs, unique_callback);
}
// Variant of mcgregor_common_subgraphs_unique with all default
// parameters.
template <typename GraphFirst,
typename GraphSecond,
typename SubGraphCallback>
void mcgregor_common_subgraphs_unique
(const GraphFirst& graph1,
const GraphSecond& graph2,
bool only_connected_subgraphs,
SubGraphCallback user_callback)
{
mcgregor_common_subgraphs_unique
(graph1, graph2,
get(vertex_index, graph1), get(vertex_index, graph2),
always_equivalent(), always_equivalent(),
only_connected_subgraphs, user_callback);
}
// Named parameter variant of mcgregor_common_subgraphs_unique
template <typename GraphFirst,
typename GraphSecond,
typename SubGraphCallback,
typename Param,
typename Tag,
typename Rest>
void mcgregor_common_subgraphs_unique
(const GraphFirst& graph1,
const GraphSecond& graph2,
bool only_connected_subgraphs,
SubGraphCallback user_callback,
const bgl_named_params<Param, Tag, Rest>& params)
{
mcgregor_common_subgraphs_unique
(graph1, graph2,
choose_const_pmap(get_param(params, vertex_index1),
graph1, vertex_index),
choose_const_pmap(get_param(params, vertex_index2),
graph2, vertex_index),
choose_param(get_param(params, edges_equivalent_t()),
always_equivalent()),
choose_param(get_param(params, vertices_equivalent_t()),
always_equivalent()),
only_connected_subgraphs, user_callback);
}
// ==========================================================================
namespace detail {
// Binary function object that intercepts subgraphs from
// mcgregor_common_subgraphs_internal and maintains a cache of the
// largest subgraphs.
template <typename GraphFirst,
typename GraphSecond,
typename VertexIndexMapFirst,
typename VertexIndexMapSecond,
typename SubGraphCallback>
struct maximum_subgraph_interceptor {
typedef typename graph_traits<GraphFirst>::vertices_size_type
VertexSizeFirst;
typedef mcgregor_common_subgraph_traits<GraphFirst, GraphSecond,
VertexIndexMapFirst, VertexIndexMapSecond> SubGraphTraits;
typedef typename SubGraphTraits::correspondence_map_first_to_second_type
CachedCorrespondenceMapFirstToSecond;
typedef typename SubGraphTraits::correspondence_map_second_to_first_type
CachedCorrespondenceMapSecondToFirst;
typedef std::pair<VertexSizeFirst,
std::pair<CachedCorrespondenceMapFirstToSecond,
CachedCorrespondenceMapSecondToFirst> > SubGraph;
typedef std::vector<SubGraph> SubGraphList;
maximum_subgraph_interceptor(const GraphFirst& graph1,
const GraphSecond& graph2,
const VertexIndexMapFirst vindex_map1,
const VertexIndexMapSecond vindex_map2,
SubGraphCallback user_callback) :
m_graph1(graph1), m_graph2(graph2),
m_vindex_map1(vindex_map1), m_vindex_map2(vindex_map2),
m_subgraphs(make_shared<SubGraphList>()),
m_largest_size_so_far(make_shared<VertexSizeFirst>(0)),
m_user_callback(user_callback) { }
template <typename CorrespondenceMapFirstToSecond,
typename CorrespondenceMapSecondToFirst>
bool operator()(CorrespondenceMapFirstToSecond correspondence_map_1_to_2,
CorrespondenceMapSecondToFirst correspondence_map_2_to_1,
VertexSizeFirst subgraph_size) {
if (subgraph_size > *m_largest_size_so_far) {
m_subgraphs->clear();
*m_largest_size_so_far = subgraph_size;
}
if (subgraph_size == *m_largest_size_so_far) {
// Make a cached copy
CachedCorrespondenceMapFirstToSecond
new_subgraph_1_to_2 = CachedCorrespondenceMapFirstToSecond
(num_vertices(m_graph1), m_vindex_map1);
CachedCorrespondenceMapSecondToFirst
new_subgraph_2_to_1 = CachedCorrespondenceMapSecondToFirst
(num_vertices(m_graph2), m_vindex_map2);
BGL_FORALL_VERTICES_T(vertex1, m_graph1, GraphFirst) {
put(new_subgraph_1_to_2, vertex1, get(correspondence_map_1_to_2, vertex1));
}
BGL_FORALL_VERTICES_T(vertex2, m_graph2, GraphFirst) {
put(new_subgraph_2_to_1, vertex2, get(correspondence_map_2_to_1, vertex2));
}
m_subgraphs->push_back(std::make_pair(subgraph_size,
std::make_pair(new_subgraph_1_to_2,
new_subgraph_2_to_1)));
}
return (true);
}
void output_subgraphs() {
for (typename SubGraphList::const_iterator
subgraph_iter = m_subgraphs->begin();
subgraph_iter != m_subgraphs->end();
++subgraph_iter) {
SubGraph subgraph_cached = *subgraph_iter;
m_user_callback(subgraph_cached.second.first,
subgraph_cached.second.second,
subgraph_cached.first);
}
}
private:
const GraphFirst& m_graph1;
const GraphFirst& m_graph2;
const VertexIndexMapFirst m_vindex_map1;
const VertexIndexMapSecond m_vindex_map2;
shared_ptr<SubGraphList> m_subgraphs;
shared_ptr<VertexSizeFirst> m_largest_size_so_far;
SubGraphCallback m_user_callback;
};
} // namespace detail
// Enumerates the largest common subgraphs found between graph1
// and graph2. Note that the ENTIRE search space is explored before
// user_callback is actually invoked.
template <typename GraphFirst,
typename GraphSecond,
typename VertexIndexMapFirst,
typename VertexIndexMapSecond,
typename EdgeEquivalencePredicate,
typename VertexEquivalencePredicate,
typename SubGraphCallback>
void mcgregor_common_subgraphs_maximum
(const GraphFirst& graph1,
const GraphSecond& graph2,
const VertexIndexMapFirst vindex_map1,
const VertexIndexMapSecond vindex_map2,
EdgeEquivalencePredicate edges_equivalent,
VertexEquivalencePredicate vertices_equivalent,
bool only_connected_subgraphs,
SubGraphCallback user_callback)
{
detail::maximum_subgraph_interceptor<GraphFirst, GraphSecond,
VertexIndexMapFirst, VertexIndexMapSecond, SubGraphCallback>
max_interceptor
(graph1, graph2, vindex_map1, vindex_map2, user_callback);
detail::mcgregor_common_subgraphs_internal_init
(graph1, graph2,
vindex_map1, vindex_map2,
edges_equivalent, vertices_equivalent,
only_connected_subgraphs, max_interceptor);
// Only output the largest subgraphs
max_interceptor.output_subgraphs();
}
// Variant of mcgregor_common_subgraphs_maximum with all default
// parameters.
template <typename GraphFirst,
typename GraphSecond,
typename SubGraphCallback>
void mcgregor_common_subgraphs_maximum
(const GraphFirst& graph1,
const GraphSecond& graph2,
bool only_connected_subgraphs,
SubGraphCallback user_callback)
{
mcgregor_common_subgraphs_maximum
(graph1, graph2,
get(vertex_index, graph1), get(vertex_index, graph2),
always_equivalent(), always_equivalent(),
only_connected_subgraphs, user_callback);
}
// Named parameter variant of mcgregor_common_subgraphs_maximum
template <typename GraphFirst,
typename GraphSecond,
typename SubGraphCallback,
typename Param,
typename Tag,
typename Rest>
void mcgregor_common_subgraphs_maximum
(const GraphFirst& graph1,
const GraphSecond& graph2,
bool only_connected_subgraphs,
SubGraphCallback user_callback,
const bgl_named_params<Param, Tag, Rest>& params)
{
mcgregor_common_subgraphs_maximum
(graph1, graph2,
choose_const_pmap(get_param(params, vertex_index1),
graph1, vertex_index),
choose_const_pmap(get_param(params, vertex_index2),
graph2, vertex_index),
choose_param(get_param(params, edges_equivalent_t()),
always_equivalent()),
choose_param(get_param(params, vertices_equivalent_t()),
always_equivalent()),
only_connected_subgraphs, user_callback);
}
// ==========================================================================
namespace detail {
// Binary function object that intercepts subgraphs from
// mcgregor_common_subgraphs_internal and maintains a cache of the
// largest, unique subgraphs.
template <typename GraphFirst,
typename GraphSecond,
typename VertexIndexMapFirst,
typename VertexIndexMapSecond,
typename SubGraphCallback>
struct unique_maximum_subgraph_interceptor {
typedef typename graph_traits<GraphFirst>::vertices_size_type
VertexSizeFirst;
typedef mcgregor_common_subgraph_traits<GraphFirst, GraphSecond,
VertexIndexMapFirst, VertexIndexMapSecond> SubGraphTraits;
typedef typename SubGraphTraits::correspondence_map_first_to_second_type
CachedCorrespondenceMapFirstToSecond;
typedef typename SubGraphTraits::correspondence_map_second_to_first_type
CachedCorrespondenceMapSecondToFirst;
typedef std::pair<VertexSizeFirst,
std::pair<CachedCorrespondenceMapFirstToSecond,
CachedCorrespondenceMapSecondToFirst> > SubGraph;
typedef std::vector<SubGraph> SubGraphList;
unique_maximum_subgraph_interceptor(const GraphFirst& graph1,
const GraphSecond& graph2,
const VertexIndexMapFirst vindex_map1,
const VertexIndexMapSecond vindex_map2,
SubGraphCallback user_callback) :
m_graph1(graph1), m_graph2(graph2),
m_vindex_map1(vindex_map1), m_vindex_map2(vindex_map2),
m_subgraphs(make_shared<SubGraphList>()),
m_largest_size_so_far(make_shared<VertexSizeFirst>(0)),
m_user_callback(user_callback) { }
template <typename CorrespondenceMapFirstToSecond,
typename CorrespondenceMapSecondToFirst>
bool operator()(CorrespondenceMapFirstToSecond correspondence_map_1_to_2,
CorrespondenceMapSecondToFirst correspondence_map_2_to_1,
VertexSizeFirst subgraph_size) {
if (subgraph_size > *m_largest_size_so_far) {
m_subgraphs->clear();
*m_largest_size_so_far = subgraph_size;
}
if (subgraph_size == *m_largest_size_so_far) {
// Check if subgraph is unique
for (typename SubGraphList::const_iterator
subgraph_iter = m_subgraphs->begin();
subgraph_iter != m_subgraphs->end();
++subgraph_iter) {
SubGraph subgraph_cached = *subgraph_iter;
if (!are_property_maps_different(correspondence_map_1_to_2,
subgraph_cached.second.first,
m_graph1)) {
// New subgraph is a duplicate
return (true);
}
}
// Subgraph is unique, so make a cached copy
CachedCorrespondenceMapFirstToSecond
new_subgraph_1_to_2 = CachedCorrespondenceMapFirstToSecond
(num_vertices(m_graph1), m_vindex_map1);
CachedCorrespondenceMapSecondToFirst
new_subgraph_2_to_1 = CachedCorrespondenceMapSecondToFirst
(num_vertices(m_graph2), m_vindex_map2);
BGL_FORALL_VERTICES_T(vertex1, m_graph1, GraphFirst) {
put(new_subgraph_1_to_2, vertex1, get(correspondence_map_1_to_2, vertex1));
}
BGL_FORALL_VERTICES_T(vertex2, m_graph2, GraphFirst) {
put(new_subgraph_2_to_1, vertex2, get(correspondence_map_2_to_1, vertex2));
}
m_subgraphs->push_back(std::make_pair(subgraph_size,
std::make_pair(new_subgraph_1_to_2,
new_subgraph_2_to_1)));
}
return (true);
}
void output_subgraphs() {
for (typename SubGraphList::const_iterator
subgraph_iter = m_subgraphs->begin();
subgraph_iter != m_subgraphs->end();
++subgraph_iter) {
SubGraph subgraph_cached = *subgraph_iter;
m_user_callback(subgraph_cached.second.first,
subgraph_cached.second.second,
subgraph_cached.first);
}
}
private:
const GraphFirst& m_graph1;
const GraphFirst& m_graph2;