24 ///\brief Mapping types for graph matching algorithms. |
24 ///\brief Mapping types for graph matching algorithms. |
25 |
25 |
26 namespace lemon { |
26 namespace lemon { |
27 ///\ingroup graph_isomorphism |
27 ///\ingroup graph_isomorphism |
28 ///The \ref Vf2 "VF2" algorithm is capable of finding different kind of |
28 ///The \ref Vf2 "VF2" algorithm is capable of finding different kind of |
29 ///embeddings, this enum specifies its type. |
29 ///graph embeddings, this enum specifies their types. |
30 /// |
30 /// |
31 ///See \ref graph_isomorphism for a more detailed description. |
31 ///See \ref graph_isomorphism for a more detailed description. |
32 enum MappingType { |
32 enum MappingType { |
33 /// Subgraph isomorphism |
33 /// Subgraph isomorphism |
34 SUBGRAPH = 0, |
34 SUBGRAPH = 0, |
35 /// Induced subgraph isomorphism |
35 /// Induced subgraph isomorphism |
36 INDUCED = 1, |
36 INDUCED = 1, |
37 /// Graph isomorphism |
37 /// Graph isomorphism |
38 |
38 /// |
39 /// If the two graph has the same number of nodes, than it is |
39 /// If the two graphs have the same number of nodes, than it is |
40 /// equivalent to \ref INDUCED, and if they also have the same |
40 /// equivalent to \ref INDUCED, and if they also have the same |
41 /// number of edges, then it is also equivalent to \ref SUBGRAPH. |
41 /// number of edges, then it is also equivalent to \ref SUBGRAPH. |
42 /// |
42 /// |
43 /// However, using this setting is faster than the other two |
43 /// However, using this setting is faster than the other two options. |
44 /// options. |
|
45 ISOMORPH = 2 |
44 ISOMORPH = 2 |
46 }; |
45 }; |
47 } |
46 } |
48 #endif |
47 #endif |