1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/lemon/bits/vf2_internals.h	Tue Sep 19 14:08:20 2017 +0200
     1.3 @@ -0,0 +1,48 @@
     1.4 +/* -*- mode: C++; indent-tabs-mode: nil; -*-
     1.5 + *
     1.6 + * This file is a part of LEMON, a generic C++ optimization library.
     1.7 + *
     1.8 + * Copyright (C) 2015-2017
     1.9 + * EMAXA Kutato-fejleszto Kft. (EMAXA Research Ltd.)
    1.10 + *
    1.11 + * Permission to use, modify and distribute this software is granted
    1.12 + * provided that this copyright notice appears in all copies. For
    1.13 + * precise terms see the accompanying LICENSE file.
    1.14 + *
    1.15 + * This software is provided "AS IS" with no warranty of any kind,
    1.16 + * express or implied, and with no claim as to its suitability for any
    1.17 + * purpose.
    1.18 + *
    1.19 + */
    1.20 +
    1.21 +#ifndef VF2_INTERNALS_H
    1.22 +#define VF2_INTERNALS_H
    1.23 +
    1.24 +
    1.25 +///\ingroup graph_properties
    1.26 +///\file
    1.27 +///\brief Mapping types for graph matching algorithms.
    1.28 +
    1.29 +namespace lemon {
    1.30 +  ///\ingroup graph_isomorphism
    1.31 +  ///The \ref Vf2 "VF2" algorithm is capable of finding different kind of
    1.32 +  ///embeddings, this enum specifies its type.
    1.33 +  ///
    1.34 +  ///See \ref graph_isomorphism for a more detailed description.
    1.35 +  enum MappingType {
    1.36 +    /// Subgraph isomorphism
    1.37 +    SUBGRAPH = 0,
    1.38 +    /// Induced subgraph isomorphism
    1.39 +    INDUCED = 1,
    1.40 +    /// Graph isomorphism
    1.41 +
    1.42 +    /// If the two graph has the same number of nodes, than it is
    1.43 +    /// equivalent to \ref INDUCED, and if they also have the same
    1.44 +    /// number of edges, then it is also equivalent to \ref SUBGRAPH.
    1.45 +    ///
    1.46 +    /// However, using this setting is faster than the other two
    1.47 +    /// options.
    1.48 +    ISOMORPH = 2
    1.49 +  };
    1.50 +}
    1.51 +#endif