COIN-OR::LEMON - Graph Library

source: lemon/lemon/bits/vf2_internals.h

Last change on this file was 1407:76349d8212d3, checked in by Peter Kovacs <kpeter@…>, 4 years ago

Improve and unify comments and API docs of VF2 algorithms (#597)

File size: 1.4 KB
Line 
1/* -*- mode: C++; indent-tabs-mode: nil; -*-
2 *
3 * This file is a part of LEMON, a generic C++ optimization library.
4 *
5 * Copyright (C) 2015-2017
6 * EMAXA Kutato-fejleszto Kft. (EMAXA Research Ltd.)
7 *
8 * Permission to use, modify and distribute this software is granted
9 * provided that this copyright notice appears in all copies. For
10 * precise terms see the accompanying LICENSE file.
11 *
12 * This software is provided "AS IS" with no warranty of any kind,
13 * express or implied, and with no claim as to its suitability for any
14 * purpose.
15 *
16 */
17
18#ifndef VF2_INTERNALS_H
19#define VF2_INTERNALS_H
20
21
22///\ingroup graph_properties
23///\file
24///\brief Mapping types for graph matching algorithms.
25
26namespace lemon {
27  ///\ingroup graph_isomorphism
28  ///The \ref Vf2 "VF2" algorithm is capable of finding different kind of
29  ///graph embeddings, this enum specifies their types.
30  ///
31  ///See \ref graph_isomorphism for a more detailed description.
32  enum MappingType {
33    /// Subgraph isomorphism
34    SUBGRAPH = 0,
35    /// Induced subgraph isomorphism
36    INDUCED = 1,
37    /// Graph isomorphism
38    ///
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
41    /// number of edges, then it is also equivalent to \ref SUBGRAPH.
42    ///
43    /// However, using this setting is faster than the other two options.
44    ISOMORPH = 2
45  };
46}
47#endif
Note: See TracBrowser for help on using the repository browser.